I/O-Optimal Algorithms for Outerplanar Graphs

DOI10.7155/JGAA.00082MaRDI QIDQ4679081zbMATH OpenOpenAlexFDO

Authors Anil Maheshwari, Norbert Zeh

Publication date 25 May 2005

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/52455

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1522938
• scientific article; zbMATH DE number 2119685
• On External-Memory Planar Depth First Search
• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
• scientific article; zbMATH DE number 1830757

Cited in

(11)

• I/O-efficient algorithms for graphs of bounded treewidth
• On External-Memory Planar Depth First Search
• scientific article; zbMATH DE number 1522938 (Why is no real title available?)
• scientific article; zbMATH DE number 1830757 (Why is no real title available?)
• scientific article; zbMATH DE number 2119685 (Why is no real title available?)
• I/O-efficient path traversal in succinct planar graphs
• I/O-efficient algorithms on near-planar graphs
• I/O-Efficient Algorithms on Near-Planar Graphs
• Shortest beer path queries in outerplanar graphs
• I/O-efficient algorithms for graphs of bounded treewidth
• Area-efficient planar straight-line drawings of outerplanar graphs

This page was built for publication: I/O-Optimal Algorithms for Outerplanar Graphs

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