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

Authors:
Jun-Ho Her;R. S. Ramakrishna
Affiliations:
Department of Information and Communications, Gwangju Institute of Science and Technology, 1 Oryong-dong, Buk-gu, Gwangju, Republic of Korea;Department of Information and Communications, Gwangju Institute of Science and Technology, 1 Oryong-dong, Buk-gu, Gwangju, Republic of Korea
Venue:
Information Processing Letters
Year:
2005

Citing 12
Cited 0

Introduction to artificial intelligence

Introduction to artificial intelligence
The input/output complexity of sorting and related problems

Communications of the ACM
External-memory graph algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
External memory BFS on undirected graphs with bounded degree

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
I/O-optimal algorithms for planar graphs using separators

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient topological sorting of planar DAGs

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Hamiltonian Cycles in Solid Grid Graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
I/O-Efficient Algorithms for Problems on Grid-Based Terrains

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we propose an external memory depth first search algorithm for solid grid graphs, a subclass of grid graphs. The I/O-complexity of the algorithm is O(sort(N)), where N=|V|+|E|, sort(N)=@Q(NBlog"M"/"BNB) is the sorting I/O-complexity, M is the memory size, and B is the block size. Since grid graphs might be nonplanar (if diagonal edges intersect), they are beyond the reach of existing planar depth first search algorithms. The best known algorithm for this class of graph is the standard (internal memory) DFS algorithm with appropriate block (sub-grid) I/O-access. Its I/O-complexity is O(NB).