Potentials in Undirected Graphs and Planar Multiflows

DOI10.1137/S0097539790186704MaRDI QIDQ4337630zbMATHOpenAlexFDO

Authors András Sebö

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539790186704

zbMATH Keywords

parallel algorithmmatchingstructuremulticommodity flowsChinese postmanT-joinsT-cuts

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Potential theory on finite graphs
• scientific article; zbMATH DE number 5896456
• Flow in Planar Graphs with Multiple Sources and Sinks
• Theorie du Potentiel sur les Graphes et les Varietes
• scientific article; zbMATH DE number 4186788
• Flow in planar graphs with vertex capacities
• Coarse Differentiation and Multi-flows in Planar Graphs
• Coarse differentiation and multi-flows in planar graphs
• Boundary-to-Boundary Flows in Planar Graphs
• Algebraic Potential Theory on Graphs

Cited in

(5)

• Combinatorial acyclicity models for potential‐based flows
• Reducing Path TSP to TSP
• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
• Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

This page was built for publication: Potentials in Undirected Graphs and Planar Multiflows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337630)