Lattices and Maximum Flow Algorithms in Planar Graphs
From MaRDI portal
Publication:3057636
DOI10.1007/978-3-642-16926-7_30zbMath1310.05201arXiv1211.2189OpenAlexW2102694510MaRDI QIDQ3057636
Publication date: 16 November 2010
Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2189
Approximation methods and heuristics in mathematical programming (90C59) Planar graphs; geometric and topological aspects of graph theory (05C10) Semimodular lattices, geometric lattices (06C10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items
On generalizations of network design problems with degree bounds ⋮ Lattices and Maximum Flow Algorithms in Planar Graphs
Cites Work
- Increasing the rooted connectivity of a digraph by one
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Lattices and Maximum Flow Algorithms in Planar Graphs
- The Lattice Structure of Flow in Planar Graphs
- Maximal Flow Through a Network
- ULD-Lattices and Δ-Bonds
- An O (n log n) algorithm for maximum st-flow in a directed planar graph
- Maximum Flow in Planar Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item