A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

DOI10.1006/JAGM.1999.1072MaRDI QIDQ4485193zbMATH OpenOpenAlexFDO

Authors Zhivko Nedev, Peter T. Wood

Publication date 26 November 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1072

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

• An algorithm for outerplanar graphs with parameter
• Approximating the pathwidth of outerplanar graphs
• Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
• Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
• A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
• Approximation of pathwidth of outerplanar graphs
• scientific article; zbMATH DE number 2044933
• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
• scientific article; zbMATH DE number 24420
• Finding an Even Simple Path in a Directed Planar Graph

Cited in

(3)

• A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
• A trichotomy for regular simple path queries on graphs
• scientific article; zbMATH DE number 841998 (Why is no real title available?)

This page was built for publication: A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs

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