I/O-Efficient Algorithms on Near-Planar Graphs

DOI10.1007/11682462_54MaRDI QIDQ5900356zbMATH OpenOpenAlexFDO

Authors Laura Toma, Herman Haverkort

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_54

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• I/O-efficient algorithms on near-planar graphs
• I/O-Efficient Planar Separators
• I/O-Optimal Algorithms for Outerplanar Graphs
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2119685

Cited in

(6)

• I/O-efficient algorithms for graphs of bounded treewidth
• I/O-Efficient Planar Separators
• Via Detours to I/O-Efficient Shortest Paths
• I/O-efficient path traversal in succinct planar graphs
• I/O-efficient algorithms on near-planar graphs
• I/O-efficient algorithms for graphs of bounded treewidth

This page was built for publication: I/O-Efficient Algorithms on Near-Planar Graphs

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