On the public citation graph

Maximum (s,t)-Flows in Planar Networks in O(|V|log|V|) Time

0 signed · 55 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.1006/jagm.1996.0831openalex-snapshot
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1073/pnas.43.9.842openalex-snapshot
TWO THEOREMS IN GRAPH THEORY
inferredcites →https://doi.org/10.1109/tit.1956.1056816openalex-snapshot
A note on the maximum flow through a network
inferredcites →https://doi.org/10.1137/0208012openalex-snapshot
Maximum Flow in Planar Networks
inferredcites →https://doi.org/10.1137/0214045openalex-snapshot
An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
inferredcites →https://doi.org/10.1137/0406038openalex-snapshot
The Lattice Structure of Flow in Planar Graphs
inferredcites →https://doi.org/10.1145/195058.195092openalex-snapshot
Faster shortest-path algorithms for planar graphs
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1998.1592openalex-snapshot
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
inferred← citeshttps://doi.org/10.1007/11533719_75openalex-snapshot
Efficient Algorithms for Simplifying Flow Networks
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_15openalex-snapshot
Simplifying Flow 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-642-04128-0_36openalex-snapshot
Maximum Flow in Directed Planar Graphs with Vertex Capacities
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_30openalex-snapshot
Lattices and Maximum Flow Algorithms in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_23openalex-snapshot
Flows in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_13openalex-snapshot
On Greedy and Submodular Matrices
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-642-25878-7_12openalex-snapshot
Accelerated Bend Minimization
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_8openalex-snapshot
Network Flows
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/bf02973440openalex-snapshot
Max-flow problem in undirected planar networks with node capacities being in NC
inferred← citeshttps://doi.org/10.1007/s00453-010-9436-7openalex-snapshot
Maximum Flow in Directed Planar Graphs with Vertex Capacities
inferred← citeshttps://doi.org/10.1007/s00454-014-9623-4openalex-snapshot
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2004.12.001openalex-snapshot
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
inferred← citeshttps://doi.org/10.1109/codit66093.2025.11321231openalex-snapshot
Minimum Topological s–t Cut Problems
inferred← citeshttps://doi.org/10.1109/cvpr.2009.5206863openalex-snapshot
Efficient planar graph cuts with applications in Computer Vision
inferred← citeshttps://doi.org/10.1109/tpami.2006.12openalex-snapshot
Globally minimal surfaces by continuous maximal flows
inferred← citeshttps://doi.org/10.1137/090766863openalex-snapshot
Homology Flows, Cohomology Cuts
inferred← citeshttps://doi.org/10.1137/1.9781611977073.7openalex-snapshot
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1137/19m1291820openalex-snapshot
Minimum Cuts in Surface Graphs
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/1536414.1536453openalex-snapshot
Homology flows, cohomology cuts
inferred← citeshttps://doi.org/10.1145/1542362.1542426openalex-snapshot
Minimum cuts and shortest homologous cycles
inferred← citeshttps://doi.org/10.1145/1998196.1998231openalex-snapshot
Shortest non-trivial cycles in directed surface graphs
inferred← citeshttps://doi.org/10.1145/2350190.2350198openalex-snapshot
Contraction network for solving maximum flow problem
inferred← citeshttps://doi.org/10.1145/2462356.2462366openalex-snapshot
Counting and sampling minimum cuts in genus g graphs
inferred← citeshttps://doi.org/10.1145/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/3744639openalex-snapshot
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
inferred← citeshttps://doi.org/10.14264/9759openalex-snapshot
Globally minimal contours and surfaces for image segmentation
inferred← citeshttps://doi.org/10.5555/2133036.2133124openalex-snapshot
Minimum cuts and shortest non-separating cycles via homology covers
inferred← citeshttps://doi.org/10.5555/2627817.2627843openalex-snapshot
Shortest non-trivial cycles in directed and undirected surface graphs
inferred← citeshttps://doi.org/10.5555/982792.982916openalex-snapshot
A deterministic near-linear time algorithm for finding minimum cuts 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.