On the public citation graph
Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
0 signed · 58 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.1002/net.3230050406openalex-snapshot
Minimal complete matchings and negative cycles
inferredcites →https://doi.org/10.1002/net.3230110105openalex-snapshot
Sensitivity analysis of optimal matchings
inferredcites →https://doi.org/10.1002/net.3230130406openalex-snapshot
An analysis of alternative strategies for implementing matching algorithms
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.1016/0095-8956(81)90093-9openalex-snapshot
Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1109/sfcs.1982.36openalex-snapshot
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs
inferredcites →https://doi.org/10.1109/tct.1964.1082356openalex-snapshot
Bi-Path Networks and Multicommodity Flows
inferredcites →https://doi.org/10.1112/plms/s3-42.1.178openalex-snapshot
On Odd Cuts and Plane Multicommodity Flows
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0214023openalex-snapshot
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
inferredcites →https://doi.org/10.4153/cjm-1954-033-3openalex-snapshot
A Short Proof of the Factor Theorem for Finite Graphs
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.1007/3-540-29297-7_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_42openalex-snapshot
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
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-63397-9_28openalex-snapshot
Improved approximations for minimum cardinality quadrangulations of finite element meshes
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_19openalex-snapshot
Multiflots et chaînes arête-disjointes
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_19openalex-snapshot
Mehrgüterflüsse und kantendisjunkte Wege
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_19openalex-snapshot
Flussi multi-prodotto e cammini arco-disgiunti
inferred← citeshttps://doi.org/10.1007/bf01185338openalex-snapshot
Parity conditions in homotopic knock-knee routing
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/bfb0039593openalex-snapshot
On local routing of two-terminal nets
inferred← citeshttps://doi.org/10.1007/s004539910002openalex-snapshot
Finding Edge-Disjoint Paths in Partial k -Trees
inferred← citeshttps://doi.org/10.1007/s10107-021-01700-8openalex-snapshot
Integer plane multiflow maximisation: one-quarter-approximation and gaps
inferred← citeshttps://doi.org/10.1007/s10107-026-02406-5openalex-snapshot
Unsplittable multicommodity flows in outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90062-5openalex-snapshot
Undirected distances and the postman-structure of graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90102-9openalex-snapshot
An algorithm for min-cost edge-disjoint cycles and its applications
inferred← citeshttps://doi.org/10.1016/0167-9260(89)90003-5openalex-snapshot
Fast algorithm for optimal layer assignment
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80112-4openalex-snapshot
Chapter 8 VLSI network design
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/43.46784openalex-snapshot
A linear-time algorithm for routing in a convex grid
inferred← citeshttps://doi.org/10.1109/43.486274openalex-snapshot
On the integration of partitioning and global routing for rectilinear placement problems
inferred← citeshttps://doi.org/10.1109/43.62777openalex-snapshot
Partitioning logic on graph structures to minimize routing cost
inferred← citeshttps://doi.org/10.1109/dac.1988.14815openalex-snapshot
Fast algorithm for optimal layer assignment
inferred← citeshttps://doi.org/10.1109/sfcs.1985.3openalex-snapshot
A scaling algorithm for weighted matching on general graphs
inferred← citeshttps://doi.org/10.1137/s0097539790186704openalex-snapshot
Potentials in Undirected Graphs and Planar Multiflows
inferred← citeshttps://doi.org/10.1145/22145.22167openalex-snapshot
Multicommodity flows in planar undirected graphs and shortest paths
inferred← citeshttps://doi.org/10.1145/77600.77620openalex-snapshot
The maximum concurrent flow problem
inferred← citeshttps://doi.org/10.5555/285730.285820openalex-snapshot
Fast algorithm for optimal layer assignment
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.