Finding k Partially Disjoint Paths in a Directed Planar Graph

DOI10.1007/978-3-662-59204-5_13zbMath1443.05048arXiv1504.00185OpenAlexW1733171300MaRDI QIDQ3295274

No author found.

Publication date: 8 July 2020

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00185

zbMATH Keywords

directed graphplanar graphdisjoint pathsgraph groupfree partially commutative grouppartially disjoint paths

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Algorithms on strings (68W32)

Related Items (2)

A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs ⋮ A tight lower bound for edge-disjoint paths on planar DAGs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The disjoint paths problem in quadratic time
• The word problem for free partially commutative groups
• The directed subgraph homeomorphism problem
• Combinatorics on traces
• On the Knuth-Bendix completion for concurrent processes
• Automorphisms of graph groups.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Graph minors. XIII: The disjoint paths problem
• Isomorphisms of Graph Groups
• Kommutationsgleichungen in semifreien gruppen
• Finding k Disjoint Paths in a Directed Planar Graph
• Inhomogeneous sorting

This page was built for publication: Finding k Partially Disjoint Paths in a Directed Planar Graph