Flows in One-Crossing-Minor-Free Graphs

DOI10.1007/978-3-642-17517-6_23zbMath1311.05185arXiv1007.1484OpenAlexW1874894208MaRDI QIDQ3060737

David Eppstein, Erin Wolf Chambers

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.1484

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (3)

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ On mimicking networks representing minimum terminal cuts ⋮ Counting and sampling minimum cuts in genus \(g\) graphs

This page was built for publication: Flows in One-Crossing-Minor-Free Graphs