Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Parallel algorithms for depth-first searches I. planar graphs
SIAM Journal on Computing
Introduction to artificial intelligence
Introduction to artificial intelligence
The input/output complexity of sorting and related problems
Communications of the ACM
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
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)
Raid Book: A Source Book for Raid Technology
Raid Book: A Source Book for Raid Technology
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
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)
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Hi-index | 5.23 |
Graph data in modern scientific and engineering applications are often too large to fit in the computer's main memory. Input/output (I/O) complexity is a major research issue in this context. Minimization of the number of I/O operations (in external memory graph algorithms) is the main focus of current research while classical (internal memory) graph algorithms were designed to minimize temporal complexity. In this paper, we propose an external memory depth first search algorithm for general grid graphs. The I/O-complexity of the algorithm is O(sort(N)log"2NM), 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. 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(N/B). Recently, the authors proposed an O(sort(N)) algorithm for solid grid graphs.