On the public citation graph

Recent developments in maximum flow algorithms

https://doi.org/10.1007/bfb0054350
0 signed · 104 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230050405openalex-snapshot
Minimum cuts and related problems
inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot
A Faster Deterministic Maximum Flow Algorithm
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/bf01415937openalex-snapshot
Implementing Goldberg's max-flow-algorithm ? A computational investigation
inferredcites →https://doi.org/10.1007/bf01580905openalex-snapshot
A combinatorial interior point method for network flow problems
inferredcites →https://doi.org/10.1007/bf01758778openalex-snapshot
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
inferredcites →https://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferredcites →https://doi.org/10.1016/0020-0190(90)90024-ropenalex-snapshot
Generating pseudo-random permutations and maximum flow algorithms
inferredcites →https://doi.org/10.1016/0022-0000(80)90035-5openalex-snapshot
An O(EVIog2V) algorithm for the maximal flow problem
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
inferredcites →https://doi.org/10.1090/dimacs/012/01openalex-snapshot
Goldberg’s algorithm for maximum flow in perspective: a computational study
inferredcites →https://doi.org/10.1090/dimacs/012/02openalex-snapshot
Implementations of the Goldberg-Tarjan maximum flow algorithm
inferredcites →https://doi.org/10.1109/sfcs.1997.646087openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1109/sfcs.1997.646090openalex-snapshot
Flows in undirected unit capacity networks
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1137/0405004openalex-snapshot
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
inferredcites →https://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1137/s0097539791278376openalex-snapshot
An $o(n^3 )$-Time Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1137/s089548019733103xopenalex-snapshot
Flows in Undirected Unit Capacity Networks
inferredcites →https://doi.org/10.1145/167088.167201openalex-snapshot
Online load balancing and network flow
inferredcites →https://doi.org/10.1145/195058.195422openalex-snapshot
Random sampling in cut, flow, and network design problems
inferredcites →https://doi.org/10.1145/225058.225267openalex-snapshot
Short length versions of Menger's theorem
inferredcites →https://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferredcites →https://doi.org/10.1145/237814.237827openalex-snapshot
Approximating s-t minimum cuts in Õ ( n 2 ) time
inferredcites →https://doi.org/10.1145/237814.237829openalex-snapshot
Minimum cuts in near-linear time
inferredcites →https://doi.org/10.1145/258533.258596openalex-snapshot
Using random sampling to find maximum flows in uncapacitated undirected graphs
inferredcites →https://doi.org/10.1145/276698.276714openalex-snapshot
Finding maximum flows in undirected graphs seems easier than bipartite matching
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.1287/moor.24.2.383openalex-snapshot
Random Sampling in Cut, Flow, and Network Design Problems
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.5555/313559.313605openalex-snapshot
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
inferredcites →https://doi.org/10.5555/314613.314833openalex-snapshot
Better random sampling algorithms for flows in undirected graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.4099openalex-snapshot
Max‐flow min‐cut algorithm with application to road networks
inferred← citeshttps://doi.org/10.1002/net.22149openalex-snapshot
Risk‐averse optimization and resilient network flows
inferred← citeshttps://doi.org/10.1007/11533719_75openalex-snapshot
Efficient Algorithms for Simplifying Flow Networks
inferred← citeshttps://doi.org/10.1007/11685654_10openalex-snapshot
Dinitz’ Algorithm: The Original Version and Even’s Version
inferred← citeshttps://doi.org/10.1007/11749776_17openalex-snapshot
A Distributed Preflow-Push for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/11816171_2openalex-snapshot
Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities
inferred← citeshttps://doi.org/10.1007/11903697_30openalex-snapshot
Research of Undirected Network Capacity Expansion Based on the Spanning-Tree
inferred← citeshttps://doi.org/10.1007/978-1-4419-7142-5_16openalex-snapshot
Discovering Communities from Social Networks: Methodologies and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4757-3333-4_12openalex-snapshot
Non-Static Network Optimization Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-58967-1_2openalex-snapshot
Max-flow Min-cut Algorithm in Spark with Application to Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_14openalex-snapshot
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_11openalex-snapshot
Clustering with Partial Information
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-23719-5_39openalex-snapshot
Maximum Flows by Incremental Breadth-First Search
inferred← citeshttps://doi.org/10.1007/bf02973440openalex-snapshot
Max-flow problem in undirected planar networks with node capacities being in NC
inferred← citeshttps://doi.org/10.1007/s00291-004-0167-5openalex-snapshot
Optimizing infrastructure network maintenance when benefits are interdependent
inferred← citeshttps://doi.org/10.1007/s10115-012-0579-5openalex-snapshot
Evolutionary isotonic separation for classification: theory and experiments
inferred← citeshttps://doi.org/10.1007/s10115-018-1226-6openalex-snapshot
A hybrid isotonic separation training algorithm with correlation-based isotonic feature selection for binary classification
inferred← citeshttps://doi.org/10.1007/s10766-022-00740-7openalex-snapshot
Scaling the Maximum Flow Computation on GPUs
inferred← citeshttps://doi.org/10.1007/s11590-006-0016-3openalex-snapshot
Maximum flow problem in wireless ad hoc networks with directional antennas
inferred← citeshttps://doi.org/10.1007/s41109-022-00483-xopenalex-snapshot
Hypergraph cuts with edge-dependent vertex weights
inferred← citeshttps://doi.org/10.1016/b978-0-12-385963-1.00005-8openalex-snapshot
Efficient CUDA Algorithms for the Maximum Network Flow Problem
inferred← citeshttps://doi.org/10.1016/b978-85-352-7814-9.50010-5openalex-snapshot
Fluxos em Redes
inferred← citeshttps://doi.org/10.1016/j.ins.2013.11.029openalex-snapshot
The maximum flow problem of uncertain network
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.002openalex-snapshot
Two flow network simplification algorithms
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00022-xopenalex-snapshot
The maximum flow problem: a real-time approach
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00804-4openalex-snapshot
Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network
inferred← citeshttps://doi.org/10.1080/15427951.2004.10129093openalex-snapshot
Graph Clustering and Minimum Cut Trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxl082openalex-snapshot
Max-Density Revisited: a Generalization and a More Efficient Algorithm
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797548openalex-snapshot
A coded-feedback construction of locally minimum-cost multicast network codes
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797551openalex-snapshot
M-Perf: An available bandwidth estimation tool for multicast applications
inferred← citeshttps://doi.org/10.1109/icdcs.2011.62openalex-snapshot
A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs
inferred← citeshttps://doi.org/10.1109/icde.2011.5767960openalex-snapshot
Schemas for safe and efficient XML processing
inferred← citeshttps://doi.org/10.1109/icumt.2009.5345545openalex-snapshot
Maximum flow based Routing and Wavelength Assignment in all-optical networks
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536352openalex-snapshot
A lock-free multi-threaded algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470401openalex-snapshot
Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms
inferred← citeshttps://doi.org/10.1109/isit.2008.4594941openalex-snapshot
Pruning network coding traffic by network coding — A new max-flow algorithm
inferred← citeshttps://doi.org/10.1109/ispdc.2005.4openalex-snapshot
A Distributed Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1109/pdp2018.2018.00038openalex-snapshot
A Hybrid Parallel Implementation for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1109/rivf.2006.1696436openalex-snapshot
An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network
inferred← citeshttps://doi.org/10.1109/tit.2010.2040859openalex-snapshot
Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms
inferred← citeshttps://doi.org/10.1109/tit.2016.2619717openalex-snapshot
Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast
inferred← citeshttps://doi.org/10.1109/tpds.2007.28openalex-snapshot
Mobility Limited Flip-Based Sensor Networks Deployment
inferred← citeshttps://doi.org/10.1109/tpds.2010.156openalex-snapshot
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic
inferred← citeshttps://doi.org/10.1109/tsmca.2005.843393openalex-snapshot
Firm Bankruptcy Prediction: Experimental Comparison of Isotonic Separation and Other Classification Approaches
inferred← citeshttps://doi.org/10.1117/12.538797openalex-snapshot
Elastic flows with deadlines: a QoS abstraction for middleware
inferred← citeshttps://doi.org/10.1145/1140335.1140343openalex-snapshot
An efficient algorithm for XML type projection
inferred← citeshttps://doi.org/10.1145/1502793.1502798openalex-snapshot
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
inferred← citeshttps://doi.org/10.1145/1592446.1592448openalex-snapshot
Detection of corrupted schema mappings in XML data integration systems
inferred← citeshttps://doi.org/10.1145/2488608.2488704openalex-snapshot
A new approach to computing maximum flows using electrical flows
inferred← citeshttps://doi.org/10.1145/3330481openalex-snapshot
Algorithm 1002
inferred← citeshttps://doi.org/10.1155/2014/874217openalex-snapshot
An Efficient Hierarchy Algorithm for Community Detection in Complex Networks
inferred← citeshttps://doi.org/10.1504/ijor.2019.10025749openalex-snapshot
Closed parasitic flow loops and dominated loops in networks
inferred← citeshttps://doi.org/10.18419/opus-2631openalex-snapshot
Key distribution schemes for resource-constrained devices in wireless sensor networks
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:6)2008openalex-snapshot
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.22028/d291-25992openalex-snapshot
Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
inferred← citeshttps://doi.org/10.24017/science.2017.3.15openalex-snapshot
Optimization Algorithm’s Problems: Comparison Study
inferred← citeshttps://doi.org/10.33915/etd.1665openalex-snapshot
Multiagent autonomous energy management
inferred← citeshttps://doi.org/10.3844/jcssp.2008.349.352openalex-snapshot
Generalized Shortest Path Problem in Uncertain Environment Based on PSO
inferred← citeshttps://doi.org/10.48550/arxiv.1805.07491openalex-snapshot
A Compositional Approach to Network Algorithms
inferred← citeshttps://doi.org/10.5120/4576-6624openalex-snapshot
Improved Edmond Karps Algorithm for Network Flow Problem
inferred← citeshttps://doi.org/10.58837/chula.the.2017.167openalex-snapshot
Random field optimization using local label hierarchy
inferred← citeshttps://doi.org/10.7301/z0hd7t0fopenalex-snapshot
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
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.