Flows in One-Crossing-Minor-Free Graphs
Data Structures and Algorithms
2015-07-16 v1
Abstract
We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given, we show that a maximum flow can be computed in O(n log n) time. In particular, maximum flows in directed K_{3,3}-minor-free graphs and directed K_5-minor-free graphs can be computed in O(n log n) time without additional assumptions.
Cite
@article{arxiv.1007.1484,
title = {Flows in One-Crossing-Minor-Free Graphs},
author = {Erin Chambers and David Eppstein},
journal= {arXiv preprint arXiv:1007.1484},
year = {2015}
}
Comments
16 pages, 4 figures