Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4769 LNCS 145-150
DOI: 10.1007/978-3-540-74839-7_14
3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hagerup, T. (2007). A very practical algorithm for the two-paths problem in 3-connected planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 145–150). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free