On the public citation graph
Maximum Flow in Planar Networks
0 signed · 114 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.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1093/comjnl/9.2.166openalex-snapshot
Programming, Games and Transportation Networks
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
inferred← citeshttps://doi.org/10.1002/1520-6750(198912)36:6<829::aid-nav3220360608>3.0.co;2-4openalex-snapshot
Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levels
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/net.21878openalex-snapshot
Max flow vitality in general and st‐planar graphs
inferred← citeshttps://doi.org/10.1002/net.22205openalex-snapshot
How vulnerable is an undirected planar graph with respect to max flow
inferred← citeshttps://doi.org/10.1002/net.3230130210openalex-snapshot
Calculating bounds on reachability and connectedness in stochastic networks
inferred← citeshttps://doi.org/10.1002/net.3230210706openalex-snapshot
Characterizing stochastic flow networks using the monte carlo method
inferred← citeshttps://doi.org/10.1002/net.3230230704openalex-snapshot
Sensitivity analysis in stochastic flow networks using the Monte Carlo method
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/jagm.1999.1072openalex-snapshot
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar 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-10843-2_5openalex-snapshot
Minimum s-t cut of a planar undirected network in o(n log2(n)) time
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_109openalex-snapshot
Maximum flow in planar networks
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_73openalex-snapshot
A linear-time algorithm for edge-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_264openalex-snapshot
Multicommodity flows in even, planar networks
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_6openalex-snapshot
a linear time algorithm for the arc disjoint Menger problem in planar directed graphs
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-1-4939-2864-4_683openalex-snapshot
Global Minimum Cuts in Surface-Embedded Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_42openalex-snapshot
Level-Planar Drawings with Few Slopes
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_7openalex-snapshot
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_13openalex-snapshot
Counting Minimum (s,t)-Cuts in Weighted Planar Graphs in Polynomial Time
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-27848-8_683-1openalex-snapshot
Global Minimum Cuts in Surface-Embedded Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-72831-0_49openalex-snapshot
Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise
inferred← citeshttps://doi.org/10.1007/bf01240733openalex-snapshot
Flow in planar graphs with vertex capacities
inferred← citeshttps://doi.org/10.1007/bf01294465openalex-snapshot
A linear-time algorithm for edge-disjoint paths in planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0030319openalex-snapshot
Finding a maximum flow in /s,t/-planar network in linear expected 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/0020-0190(81)90120-4openalex-snapshot
Maximum flow in (s,t) planar networks
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90036-5openalex-snapshot
A note on finding minimum cuts in directed planar networks by parallel computations
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90035-5openalex-snapshot
An O(EVIog2V) algorithm for the maximal flow problem
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90020-lopenalex-snapshot
On maximum flows in polyhedral domains
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90031-wopenalex-snapshot
Bounding the variance in Monte Carlo experiments
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.02.049openalex-snapshot
Allocation under a general substitution structure
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.017openalex-snapshot
Counting and sampling minimum (s,t) -cuts in weighted planar graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.034openalex-snapshot
Faster shortest paths in dense distance graphs, with applications
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1017/s0269964800001340openalex-snapshot
Evaluating Reliability of Stochastic Flow Networks
inferred← citeshttps://doi.org/10.1017/s0269964800002345openalex-snapshot
Capacity Expansion in Stochastic Flow Networks
inferred← citeshttps://doi.org/10.1021/acs.est.3c04291openalex-snapshot
Networking Chemicals Flows: Efficiency–Value–Environment Functionalized Symbiosis Algorithms and Application
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2600662openalex-snapshot
An Alternate Linear Algorithm for the Minimum Flow Problem
inferred← citeshttps://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferred← citeshttps://doi.org/10.1080/15326348508807015openalex-snapshot
Maximum flow in planar networks with exponentially distributed arc capacities
inferred← citeshttps://doi.org/10.1109/12.53581openalex-snapshot
Unifying maximum cut and minimum cut of a planar graph
inferred← citeshttps://doi.org/10.1109/92.219910openalex-snapshot
On the optimal reconfiguration of multipipeline arrays in the presence of faulty processing and switching elements
inferred← citeshttps://doi.org/10.1109/codit.2018.8394790openalex-snapshot
Minimum flows in directed s-t planar networks with arcs and nodes capacities
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/escience55777.2022.00028openalex-snapshot
Towards Optimal Line of Sight Coverage
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/iscas.1994.409331openalex-snapshot
On three-way graph partitioning
inferred← citeshttps://doi.org/10.1109/sfcs.1982.83openalex-snapshot
Parallel algorithms for minimum cuts and maximum flows in planar networks
inferred← citeshttps://doi.org/10.1109/sfcs.1983.44openalex-snapshot
Partition of planar flow networks
inferred← citeshttps://doi.org/10.1109/sfcs.1983.69openalex-snapshot
Shortest path problems 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.1994.365695openalex-snapshot
Maximum (s,t)-flows in planar networks in O(|V|log|V|) time
inferred← citeshttps://doi.org/10.1109/tip.2012.2188034openalex-snapshot
Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking
inferred← citeshttps://doi.org/10.1111/cgf.12568openalex-snapshot
Paint and Click: Unified Interactions for Image Boundaries
inferred← citeshttps://doi.org/10.1111/cgf.13174openalex-snapshot
Visualizing the Uncertainty of Graph‐based 2D Segmentation with Min‐path Stability
inferred← citeshttps://doi.org/10.1137/0209020openalex-snapshot
A Multiterminal Minimum Cut Algorithm for Planar Graphs
inferred← citeshttps://doi.org/10.1137/0212005openalex-snapshot
Minimum s - t Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
inferred← citeshttps://doi.org/10.1137/0214023openalex-snapshot
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
inferred← citeshttps://doi.org/10.1137/0214045openalex-snapshot
An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
inferred← citeshttps://doi.org/10.1137/0215034openalex-snapshot
Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
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/0910014openalex-snapshot
Monte Carlo, Control Variates, and Stochastic Ordering
inferred← citeshttps://doi.org/10.1137/1.9781611976465.52openalex-snapshot
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane
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/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/s0097539795281232openalex-snapshot
The Load, Capacity, and Availability of Quorum Systems
inferred← citeshttps://doi.org/10.1137/s0895479896308433openalex-snapshot
Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
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/1998196.1998231openalex-snapshot
Shortest non-trivial cycles in directed surface 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/2684068openalex-snapshot
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
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/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/3519935.3519998openalex-snapshot
Almost-linear ε -emulators for planar 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.1145/73393.73428openalex-snapshot
On maximum flows in polyhedral domains
inferred← citeshttps://doi.org/10.1287/opre.35.4.607openalex-snapshot
The Distribution of Maximum Flow with Applications to Multistate Reliability Systems
inferred← citeshttps://doi.org/10.1287/opre.40.3.s195openalex-snapshot
Constant Access Systems: A General Framework for Greedy Optimization on Stochastic Networks
inferred← citeshttps://doi.org/10.15837/ijccc.2016.2.2444openalex-snapshot
The Maximum Flows in Planar Dynamic Networks
inferred← citeshttps://doi.org/10.3233/fi-2018-1737openalex-snapshot
Maximum Flows in Planar Dynamic Networks with Lower Bounds
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.48550/arxiv.1912.11103openalex-snapshot
A near-linear time minimum Steiner cut algorithm for planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.02375openalex-snapshot
Max-flow vitality in undirected unweighted planar graphs
inferred← citeshttps://doi.org/10.5430/air.v2n1p81openalex-snapshot
The dual network theorem for static flow networks and its application for maximising the throughput flow
inferred← citeshttps://doi.org/10.5555/2095116.2095219openalex-snapshot
Global minimum cuts in surface embedded graphs
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.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.