Planar Digraphs
From MaRDI portal
Publication:3120437
DOI10.1007/978-3-319-71840-8_5zbMath1407.05114OpenAlexW4231621931MaRDI QIDQ3120437
Michał Pilipczuk, Marcin Pilipczuk
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_5
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irrelevant vertices for the planar disjoint paths problem
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- The directed subgraph homeomorphism problem
- Quickly excluding a planar graph
- Packing directed circuits
- A data structure for dynamic trees
- Directed tree-width
- Graph minors. XIII: The disjoint paths problem
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- The Directed Grid Theorem
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
- Multicommodity flow, well-linked terminals, and routing problems
- Finding k Disjoint Paths in a Directed Planar Graph
- On Independent Circuits Contained in a Graph
- Algorithms - ESA 2003
- Graph partitioning using single commodity flows
- Faster shortest-path algorithms for planar graphs
This page was built for publication: Planar Digraphs
