On the public citation graph
Implementing Goldberg's max-flow-algorithm ? A computational investigation
0 signed · 74 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50517-2_69openalex-snapshot
Analysis of preflow push algorithms for maximum network flow
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/bf02288321openalex-snapshot
A computational comparison of the dinic and network simplex methods for maximum flow
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/355873.355874openalex-snapshot
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
inferredcites →https://doi.org/10.1145/800076.802464openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.15807/jorsj.26.61openalex-snapshot
ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/cpe.3181openalex-snapshot
Massively multithreaded maxflow for image segmentation on the Cray XMT‐2
inferred← citeshttps://doi.org/10.1002/net.21467openalex-snapshot
Simplifications and speedups of the pseudoflow algorithm
inferred← citeshttps://doi.org/10.1002/net.21572openalex-snapshot
Efficient algorithms for the maximum concurrent flow problem
inferred← citeshttps://doi.org/10.1006/jagm.1994.1043openalex-snapshot
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
inferred← citeshttps://doi.org/10.1006/jagm.1995.0805openalex-snapshot
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
inferred← citeshttps://doi.org/10.1006/jagm.2000.1136openalex-snapshot
Cut Tree Algorithms: An Experimental Study
inferred← citeshttps://doi.org/10.1007/11499251_10openalex-snapshot
Minimum-Cost Optimization in Multicommodity Logistic Chain Network
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_49openalex-snapshot
On implementing push-relabel method for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3632-7_2openalex-snapshot
Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow
inferred← citeshttps://doi.org/10.1007/978-3-319-14612-6_3openalex-snapshot
A Compact Linear Programming Relaxation for Binary Sub-modular MRF
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_19openalex-snapshot
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_102openalex-snapshot
Einige Bemerkungen zu algorithmischen Verbesserungen für den Preflow-Push-Ansatz zur Bestimmung maximaler Flüsse
inferred← citeshttps://doi.org/10.1007/978-3-642-74862-2_54openalex-snapshot
Erfahrungen mit neuen Ansätzen zur Lösung des Max-Flow-Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_3openalex-snapshot
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
inferred← citeshttps://doi.org/10.1007/bf01580084openalex-snapshot
Diagnosing infeasibilities in network flow problems
inferred← citeshttps://doi.org/10.1007/bf01585996openalex-snapshot
An efficient cost scaling algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02192042openalex-snapshot
An auction algorithm for the max-flow problem
inferred← citeshttps://doi.org/10.1007/bf02564832openalex-snapshot
An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/bfb0054350openalex-snapshot
Recent developments in maximum flow algorithms
inferred← citeshttps://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/s004539910009openalex-snapshot
Practical Performance of Efficient Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1007/s11554-013-0344-3openalex-snapshot
A competitive study of the pseudoflow algorithm for the minimum s–t cut problem in vision applications
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90074-lopenalex-snapshot
ORSEP (operations research software exchange program)
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90060-9openalex-snapshot
The maximum flow problem: A max-preflow approach
inferred← citeshttps://doi.org/10.1016/j.cor.2006.12.023openalex-snapshot
Efficient preflow push algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.02.032openalex-snapshot
Preemptive benchmarking problem: An approach for official statistics in small areas
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.04.012openalex-snapshot
Enhanced instance space analysis for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.107openalex-snapshot
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow
inferred← citeshttps://doi.org/10.1016/s0305-0548(03)00171-0openalex-snapshot
A generalization of the scaling max-flow algorithm
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00269-xopenalex-snapshot
Computational investigations of maximum flow algorithms
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1090/dimacs/012/10openalex-snapshot
An experimental implementation of the dual cancel and tighten algorithm for minimum-cost network flow
inferred← citeshttps://doi.org/10.1109/cvpr.2008.4587464openalex-snapshot
A Scalable graph-cut algorithm for N-D grids
inferred← citeshttps://doi.org/10.1109/cvpr.2010.5539898openalex-snapshot
Parallel graph-cuts by adaptive bottom-up merging
inferred← citeshttps://doi.org/10.1109/ipccc66453.2025.11304666openalex-snapshot
An Efficient Push-Relabel Implementation for Max-Flow Computations on GPUs
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646087openalex-snapshot
Beyond the flow decomposition barrier
inferred← citeshttps://doi.org/10.1145/1294261.1294265openalex-snapshot
Secure web applications via automatic partitioning
inferred← citeshttps://doi.org/10.1145/140901.140919openalex-snapshot
On the parallel implementation of Goldberg's maximum flow algorithm
inferred← citeshttps://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferred← citeshttps://doi.org/10.1145/3120895.3120907openalex-snapshot
FPGA Implementation of A Graph Cut Algorithm For Stereo Vision
inferred← citeshttps://doi.org/10.1177/23998083221118570openalex-snapshot
Towards a 15-minute city: A network-based evaluation framework
inferred← citeshttps://doi.org/10.1287/opre.1080.0572openalex-snapshot
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1287/opre.48.6.894.12392openalex-snapshot
Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem
inferred← citeshttps://doi.org/10.17771/pucrio.acad.28092openalex-snapshot
ANALYTICAL REPRESENTATION OF IMMEDIATE COST FUNCTIONS IN SDDP
inferred← citeshttps://doi.org/10.21236/ada323468openalex-snapshot
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine.
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.21openalex-snapshot
Efficiently Computing Maximum Flows in Scale-Free Networks
inferred← citeshttps://doi.org/10.5244/c.26.61openalex-snapshot
MaxFlow Revisited: An Empirical Comparison of Maxflow Algorithms for Dense Vision Problems
inferred← citeshttps://doi.org/10.5555/982792.982942openalex-snapshot
A fast approximation scheme for fractional covering problems with variable upper bounds
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.