Planar Digraphs

DOI10.1007/978-3-319-71840-8_5MaRDI QIDQ3120437zbMATH OpenOpenAlexFDO

Authors Marcin Pilipczuk, Michał 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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 1099607
• PLANAR GRAPHS AND RELATED TOPICS
• scientific article; zbMATH DE number 4189751
• scientific article; zbMATH DE number 1775439
• Planar graphs on the projective plane
• Planar transitive graphs
• Planar graphs as VPG-graphs
• Planar graphs as VPG-graphs

Cites work

• scientific article; zbMATH DE number 524138 (Why is no real title available?)
• scientific article; zbMATH DE number 6820196 (Why is no real title available?)
• scientific article; zbMATH DE number 6297748 (Why is no real title available?)
• A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
• A data structure for dynamic trees
• An O(n n) algorithm for maximum st-flow in a directed planar graph
• Directed tree-width
• Faster shortest-path algorithms for planar graphs
• Finding k Disjoint Paths in a Directed Planar Graph
• Graph minors. XIII: The disjoint paths problem
• Graph partitioning using single commodity flows
• Graphs on surfaces
• Improved bounds on the planar branchwidth with respect to the largest grid minor size
• Irrelevant vertices for the planar disjoint paths problem
• Lower bounds based on the exponential time hypothesis
• Multicommodity flow, well-linked terminals, and routing problems
• On Independent Circuits Contained in a Graph
• Packing directed circuits
• Parameterized tractability of edge-disjoint paths on directed acyclic graphs
• Quickly excluding a planar graph
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
• The directed grid theorem
• The directed subgraph homeomorphism problem

Cited in

(8)

• Panelling planar graphs
• Deeply asymmetric planar graphs
• Planar Legendrian graphs
• Planar hypohamiltonian oriented graphs
• Gap-Planar Graphs
• Planar transitive graphs
• scientific article; zbMATH DE number 37833 (Why is no real title available?)
• Shortcutting Planar Digraphs

This page was built for publication: Planar Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120437)