A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs

DOI10.1007/978-3-540-74839-7_14zbMath1141.68533OpenAlexW1881159303MaRDI QIDQ3508562

Torben Hagerup

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74839-7_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Rooted \(K_4\)-minors ⋮ Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Cites Work

• Unnamed Item
• A simple solution to the two paths problem in planar graphs
• The directed subgraph homeomorphism problem
• Graph minors. XIII: The disjoint paths problem
• Solving the 2-disjoint paths problem in nearly linear time
• A Polynomial Solution to the Undirected Two Paths Problem
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Finding k Disjoint Paths in a Directed Planar Graph
• AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

This page was built for publication: A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs