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

Torben Hagerup. A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. In Andreas Brandstädt, Dieter Kratsch, Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Volume 4769 of Lecture Notes in Computer Science, pages 145-150, Springer, 2007. [doi]

Abstract

Abstract is missing.