A very practical algorithm for the two-paths problem in 3-connected planar graphs

Authors:
Torben Hagerup
Affiliations:
Institut für Informatik, Universität Augsburg, Augsburg, Germany
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 6
Cited 1

A simple solution to the two paths problem in planar graphs

Information Processing Letters
Finding $k$ Disjoint Paths in a Directed Planar Graph

SIAM Journal on Computing
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Journal of the ACM (JACM)
A Polynomial Solution to the Undirected Two Paths Problem

Journal of the ACM (JACM)
The equivalence of theorem proving and the interconnection problem

ACM SIGDA Newsletter

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear-time algorithm that does not need a planar embedding is presented for the problem of computing two vertex-disjoint paths, each with prescribed endpoints, in an undirected 3-connected planar graph.