On the public citation graph
An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
0 signed · 60 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0020-0190(81)90120-4openalex-snapshot
Maximum flow in (s,t) planar networks
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1109/sfcs.1978.5openalex-snapshot
A new algorithm for the maximal flow problem
inferredcites →https://doi.org/10.1137/0212005openalex-snapshot
Minimum s - t Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
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.1002/net.21878openalex-snapshot
Max flow vitality in general and st‐planar graphs
inferred← citeshttps://doi.org/10.1006/jagm.1996.0831openalex-snapshot
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1006/jcss.1997.1493openalex-snapshot
Faster Shortest-Path Algorithms for Planar Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1997.1538openalex-snapshot
Maximum (s,t)-Flows in Planar Networks in O(|V|log|V|) Time
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_29openalex-snapshot
Extension of the parallel nested dissection algorithm to path algebra problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_626openalex-snapshot
Planar Maximum s- t Flow
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_6openalex-snapshot
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_57openalex-snapshot
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
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/bf01240733openalex-snapshot
Flow in planar graphs with vertex capacities
inferred← citeshttps://doi.org/10.1007/bfb0028593openalex-snapshot
Construction of non-intersecting colored flows through a planar cellular figure
inferred← citeshttps://doi.org/10.1007/bfb0049403openalex-snapshot
Edge-disjoint (s, t)-paths in undirected planar graphs in linear time
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/0022-0000(89)90013-5openalex-snapshot
Fast and efficient solution of path algebra problems
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00111-4openalex-snapshot
Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(86)90074-xopenalex-snapshot
Parallel nested dissection for path algebra computations
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1051/ita:2004011openalex-snapshot
Algebraic tools for the construction of colored flows with boundary constraints
inferred← citeshttps://doi.org/10.1109/codit.2019.8820635openalex-snapshot
Minimum Flows in Directed Planar Dynamic Networks
inferred← citeshttps://doi.org/10.1109/codit66093.2025.11321231openalex-snapshot
Minimum Topological s–t Cut Problems
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00124openalex-snapshot
Near-Optimal $\left(1+\epsilon\right)-\text{Approximate}$ Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63464openalex-snapshot
Flow in planar graphs with multiple sources and sinks
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366861openalex-snapshot
A linear-processor polylog-time algorithm for shortest paths in planar graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365695openalex-snapshot
Maximum (s,t)-flows in planar networks in O(|V|log|V|) time
inferred← citeshttps://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferred← citeshttps://doi.org/10.1137/0406038openalex-snapshot
The Lattice Structure of Flow in Planar Graphs
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/18m1183297openalex-snapshot
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals
inferred← citeshttps://doi.org/10.1137/s0097539789162997openalex-snapshot
Flow in Planar Graphs with Multiple Sources and Sinks
inferred← citeshttps://doi.org/10.1137/s0097539793253565openalex-snapshot
The Vertex-Disjoint Menger Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0895480190177042openalex-snapshot
The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
inferred← citeshttps://doi.org/10.1142/s0218126622300045openalex-snapshot
Minimum Flows in Directed 1−n Planar Static and Dynamic Networks with Arcs and Nodes Capacities
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/1993636.1993679openalex-snapshot
Improved algorithms for min cut and max flow in undirected planar graphs
inferred← citeshttps://doi.org/10.1145/2462356.2462366openalex-snapshot
Counting and sampling minimum cuts in genus g graphs
inferred← citeshttps://doi.org/10.1145/31846.31849openalex-snapshot
Parallel algorithms for minimum cuts and maximum flows in planar networks
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.15837/ijccc.2016.2.2444openalex-snapshot
The Maximum Flows in Planar Dynamic Networks
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.117openalex-snapshot
Minimum s-t cut in undirected planar graphs when the source and the sink are close
inferred← citeshttps://doi.org/10.5555/2095116.2095219openalex-snapshot
Global minimum cuts in surface embedded graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00610openalex-snapshot
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
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.