Potentials in Undirected Graphs and Planar Multiflows
From MaRDI portal
Publication:4337630
DOI10.1137/S0097539790186704zbMath0867.05035OpenAlexW1970824097MaRDI QIDQ4337630
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
Deterministic network models in operations research (90B10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths ⋮ Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths ⋮ Reducing Path TSP to TSP
This page was built for publication: Potentials in Undirected Graphs and Planar Multiflows