Linear time algorithms for disjoint two-face patrhs problems in planar graphs

DOI10.1007/3-540-57568-5_265MaRDI QIDQ4268438zbMATH OpenFDO

Authors Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe

Publication date 31 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57568-5_265

Mathematics Subject Classification ID

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

Recommendations

• LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
• scientific article; zbMATH DE number 437535
• A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
• The Vertex-Disjoint Menger Problem in Planar Graphs

Cited in

(5)

• scientific article; zbMATH DE number 437535 (Why is no real title available?)
• A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
• scientific article; zbMATH DE number 780786 (Why is no real title available?)
• LINEAR-TIME ALGORITHMS FOR DISJOINT TWO-FACE PATHS PROBLEMS IN PLANAR GRAPHS
• Finding Tutte paths in linear time

This page was built for publication: Linear time algorithms for disjoint two-face patrhs problems in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268438)