On External-Memory Planar Depth First Search

DOI10.7155/JGAA.00063MaRDI QIDQ4435346zbMATH OpenOpenAlexFDO

Authors Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh

Publication date 30 November 2003

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/50434

zbMATH Keywords

graph algorithmssparse graphsembedded planar graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1830757
• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 1522938
• scientific article; zbMATH DE number 2119685
• I/O-Efficient Planar Separators

Cited in

(14)

• I/O-efficient algorithms for graphs of bounded treewidth
• External-memory depth-first search algorithm for solid grid graphs
• An external-memory depth-first search algorithm for general grid graphs
• scientific article; zbMATH DE number 1830757 (Why is no real title available?)
• Planar graph blocking for external searching
• scientific article; zbMATH DE number 2080207 (Why is no real title available?)
• Certifying induced subgraphs in large graphs
• Efficient semi-external depth-first search
• Algorithm Theory - SWAT 2004
• Via Detours to I/O-Efficient Shortest Paths
• scientific article; zbMATH DE number 1522938 (Why is no real title available?)
• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 2119685 (Why is no real title available?)
• Multiway simple cycle separators and I/O-efficient algorithms for planar graphs

This page was built for publication: On External-Memory Planar Depth First Search

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