External-memory depth-first search algorithm for solid grid graphs

DOI10.1016/J.IPL.2004.09.025MaRDI QIDQ835024zbMATH OpenOpenAlexFDO

Authors Jun-Ho Her, R. S. Ramakrishna

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.09.025

zbMATH Keywords

graph algorithmsI/O-complexityexternal-memory algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• An external-memory depth-first search algorithm for general grid graphs
• On External-Memory Planar Depth First Search
• Publication:4886043
• scientific article; zbMATH DE number 1830757
• External memory BFS on undirected graphs with bounded degree.

Cites work

• scientific article; zbMATH DE number 3978432 (Why is no real title available?)
• scientific article; zbMATH DE number 1305462 (Why is no real title available?)
• scientific article; zbMATH DE number 2119685 (Why is no real title available?)
• scientific article; zbMATH DE number 910869 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 1445352 (Why is no real title available?)
• External memory BFS on undirected graphs with bounded degree.
• I/O-Efficient Algorithms for Problems on Grid-Based Terrains
• On External-Memory Planar Depth First Search

Cited in

(3)

• An external-memory depth-first search algorithm for general grid graphs
• Efficient semi-external depth-first search
• Design and Engineering of External Memory Traversal Algorithms for General Graphs

This page was built for publication: External-memory depth-first search algorithm for solid grid graphs

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