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

DOI10.1016/j.ipl.2004.09.025zbMath1173.68605OpenAlexW2033680271MaRDI QIDQ835024

R. S. Ramakrishna, Jun-Ho Her

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

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

Related Items

An external-memory depth-first search algorithm for general grid graphs

Cites Work

• On External-Memory Planar Depth First Search
• I/O-Efficient Algorithms for Problems on Grid-Based Terrains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item