On the public citation graph

On the complexity of preflow-push algorithms for maximum-flow problems

https://doi.org/10.1007/bf01187018
0 signed · 26 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.1007/bfb0032035openalex-snapshot
Can a maximum flow be computed in o(nm) time?
inferredcites →https://doi.org/10.1137/0218072openalex-snapshot
Analysis of Preflow Push Algorithms for Maximum Network Flow
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.21236/ada214689openalex-snapshot
Network 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/9781118033104.ch12openalex-snapshot
Flows in Networks
inferred← citeshttps://doi.org/10.1002/9781118033142.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_476openalex-snapshot
Optimization in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_8openalex-snapshot
Flots dans les réseaux
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_39openalex-snapshot
The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
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-24488-9_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_8openalex-snapshot
Reti di flusso
inferred← citeshttps://doi.org/10.1007/bf01240737openalex-snapshot
A faster parametric minimum-cut algorithm
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.1016/j.cor.2006.12.023openalex-snapshot
Efficient preflow push algorithms
inferred← citeshttps://doi.org/10.1016/j.future.2025.108013openalex-snapshot
Cost-aware routing for computation offloading in knowledge-defined AIoT
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00019-8openalex-snapshot
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
inferred← citeshttps://doi.org/10.1109/icws53863.2021.00068openalex-snapshot
An Assurance-Based Risk Management Framework for Distributed Systems
inferred← citeshttps://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
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.