On external-memory planar depth first search

DOI10.1007/3-540-44634-6_43MaRDI QIDQ4778580zbMATH OpenFDO

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

Publication date 18 November 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250471, http://www.jgaa.info/accepted/2003/Arge+2003.7.2.pdf

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On External-Memory Planar Depth First Search
• Algorithm Theory - SWAT 2004
• External memory algorithms for outerplanar graphs
• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 2119685

Cited in

(6)

• An external-memory depth-first search algorithm for general grid graphs
• On external-memory MST, SSSP, and multi-way planar graph separation
• On External-Memory Planar Depth First Search
• External memory algorithms for outerplanar graphs
• I/O-Optimal Algorithms for Outerplanar Graphs
• External-memory depth-first search algorithm for solid grid 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 Q4778580)