On the public citation graph
The Lattice Structure of Flow in Planar Graphs
0 signed · 54 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/3-540-52921-7_52openalex-snapshot
Efficient sequential and parallel algorithms for planar minimum cost flow
inferredcites →https://doi.org/10.1007/bfb0120902openalex-snapshot
On the structure of all minimum cuts in a network and applications
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/b978-0-12-566780-7.50018-0openalex-snapshot
Structural Theory for the Combinatorial Systems Characterized by Submodular Functions
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.1137/0214045openalex-snapshot
An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1137/0220022openalex-snapshot
Efficient Parallel Algorithms for Testing k and Finding Disjoint s - t Paths in Graphs
inferredcites →https://doi.org/10.1145/31846.31849openalex-snapshot
Parallel algorithms for minimum cuts and maximum flows in planar networks
inferredcites →https://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferredcites →https://doi.org/10.2307/2583328openalex-snapshot
The Stable Marriage Problem: Structure and Algorithms
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/jagm.1996.0831openalex-snapshot
Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
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-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-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-45278-9_7openalex-snapshot
Boundary-to-Boundary Flows in Planar Graphs
inferred← citeshttps://doi.org/10.1007/pl00009161openalex-snapshot
Multicommodity Flows in Even, Planar Networks
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/s004530010029openalex-snapshot
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90059-qopenalex-snapshot
Lower bounds for planar orthogonal drawings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.008openalex-snapshot
Decomposition theorem on matchable distributive lattices
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2014.10.020openalex-snapshot
Non-matchable distributive lattices
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.07.011openalex-snapshot
Distributive lattices, polyhedra, and generalized flows
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/s0020-0190(97)00153-1openalex-snapshot
A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs
inferred← citeshttps://doi.org/10.1109/codit66093.2025.11321231openalex-snapshot
Minimum Topological s–t Cut Problems
inferred← citeshttps://doi.org/10.1109/focs.2011.73openalex-snapshot
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
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/1.9781611977073.7openalex-snapshot
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1137/15m1042929openalex-snapshot
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
inferred← citeshttps://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1145/1361192.1361196openalex-snapshot
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
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/2582112.2582163openalex-snapshot
Optimal Geometric Flows via Dual Programs
inferred← citeshttps://doi.org/10.1145/3188745.3188904openalex-snapshot
Holiest minimum-cost paths and flows in surface graphs
inferred← citeshttps://doi.org/10.1145/3504032openalex-snapshot
Max Flows in Planar Graphs with Vertex Capacities
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.4171/aihpd/82openalex-snapshot
Unified bijections for planar hypermaps with general cycle-length constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08683openalex-snapshot
Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08479openalex-snapshot
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth
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.