Flows in One-Crossing-Minor-Free Graphs

DOI10.7155/jgaa.00291zbMath1261.05038OpenAlexW3104625577MaRDI QIDQ4913762

David Eppstein, Erin Wolf Chambers

Publication date: 9 April 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00291

zbMATH Keywords

maximum flow problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (4)

Minimum Cuts in Surface Graphs ⋮ Unnamed Item ⋮ An exponential lower bound for cut sparsifiers in planar graphs ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs

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