External memory algorithms for outerplanar graphs

DOI10.1007/3-540-46632-0_31MaRDI QIDQ4511234zbMATH OpenFDO

Authors Anil Maheshwari, Norbert Zeh

Publication date 8 July 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46632-0_31

zbMATH Keywords

external memory algorithmsouterplanarity testing

Mathematics Subject Classification ID

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

Recommendations

• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 1830757
• On External-Memory Planar Depth First Search
• An external memory data structure for shortest path queries
• External memory BFS on undirected graphs with bounded degree.

Cited in

(14)

• An external memory data structure for shortest path queries
• An external-memory algorithm for string graph construction
• The Laplacian spectral radius of graphs on surfaces
• Heuristics for the maximum outerplanar subgraph problem
• A computational study of external-memory BFS algorithms
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• On External-Memory Planar Depth First Search
• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 1830757 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• Splitting plane graphs to outerplanarity
• An improved algorithm for finding maximum outerplanar subgraphs
• Splitting plane graphs to outerplanarity
• Spanning cactus and spanning cactus extension of outerplanar graphs

This page was built for publication: External memory algorithms for outerplanar graphs

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