On the public citation graph

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks

https://doi.org/10.1137/0214023
0 signed · 46 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01584644openalex-snapshot
Two commodity network flows and linear programming
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.1016/0095-8956(81)90093-9openalex-snapshot
Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
inferredcites →https://doi.org/10.1109/tct.1964.1082356openalex-snapshot
Bi-Path Networks and Multicommodity Flows
inferredcites →https://doi.org/10.1137/0208012openalex-snapshot
Maximum Flow in Planar Networks
inferredcites →https://doi.org/10.1145/322092.322100openalex-snapshot
Two-Commodity Flow
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.3230200405openalex-snapshot
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
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/3-540-49381-6_44openalex-snapshot
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_78openalex-snapshot
A faster algorithm for edge-disjoint paths in planar graphs
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/978-3-031-38906-1_14openalex-snapshot
Online Interval Scheduling with Predictions
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_3openalex-snapshot
Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/bf01185338openalex-snapshot
Parity conditions in homotopic knock-knee routing
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/bf01553903openalex-snapshot
Algorithms for multicommodity flows in planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0009496openalex-snapshot
Finding edge-disjoint paths in partial k-trees
inferred← citeshttps://doi.org/10.1007/pl00009161openalex-snapshot
Multicommodity Flows in Even, Planar Networks
inferred← citeshttps://doi.org/10.1007/s004539910002openalex-snapshot
Finding Edge-Disjoint Paths in Partial k -Trees
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(90)90133-wopenalex-snapshot
Sparsest cuts and bottlenecks in graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90134-xopenalex-snapshot
Multicommodity flows in certain planar directed networks
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90136-zopenalex-snapshot
Edge-disjoint paths in a grid bounded by two nested rectangles
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90059-lopenalex-snapshot
Variable-priority queue and doughnut routing
inferred← citeshttps://doi.org/10.1016/j.amc.2006.10.017openalex-snapshot
Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103795openalex-snapshot
Online interval scheduling with predictions
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00223-2openalex-snapshot
The edge-disjoint paths problem is NP-complete for series–parallel graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00048-7openalex-snapshot
A software package of algorithms and heuristics for disjoint paths in Planar Networks
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70159-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70553-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80112-4openalex-snapshot
Chapter 8 VLSI network design
inferred← citeshttps://doi.org/10.1109/43.46784openalex-snapshot
A linear-time algorithm for routing in a convex grid
inferred← citeshttps://doi.org/10.1109/tcad.1985.1270099openalex-snapshot
A Linear-Time Routing Algorithm for Convex Grids
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/1.9781611975482.63openalex-snapshot
Nearly ETH-tight algorithms for P lanar S teiner T ree with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1137/1.9781611977073.81openalex-snapshot
Planar Multiway Cut with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1137/17m1151225openalex-snapshot
Refined Vertex Sparsifiers of Planar Graphs
inferred← citeshttps://doi.org/10.1145/22145.22167openalex-snapshot
Multicommodity flows in planar undirected graphs and shortest paths
inferred← citeshttps://doi.org/10.1145/3371389openalex-snapshot
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1145/3686800openalex-snapshot
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs
inferred← citeshttps://doi.org/10.1145/3776738openalex-snapshot
Planar Multiway Cut with Terminals on Few Faces
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.