Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
The input/output complexity of sorting and related problems
Communications of the ACM
Linear-processor NC algorithms for planar directed graphs I: strongly connected components
SIAM Journal on Computing
Linear-processor NC algorithms for planar directed graphs II: directed spanning trees
SIAM Journal on Computing
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
External-memory graph algorithms
Proceedings of the sixth 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 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
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
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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 shortest path related problems
I/o-efficient algorithms for shortest path related problems
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Proceedings of the 2006 ACM symposium on Applied computing
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
I/o-efficient efficient algorithms for computing contours on a terrain
Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Cache-oblivious planar shortest paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
I/O-Efficient algorithms on near-planar graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
On (dynamic) range minimum queries in external memory
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present algorithms that solve a number of fundamental problems on planar directed graphs (planar digraphs) in O((N)) I/Os, where (N) is the number of I/Os needed to sort N elements. The problems we consider are breadth-first search, the single-source shortest path problem, computing a directed ear decomposition of a strongly connected planar digraph, computing an open directed ear decomposition of a strongly connected biconnected planar digraph, and topologically sorting a planar directed acyclic graph.