I/O-efficient strong connectivity and depth-first search for directed planar graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 261-270

  Arge, L ^a   Zeh, N ^b  

^a Duke University   (United States)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Computer science; Electronic switching systems; Engineering profession; Fellows; Geographic Information Systems; Performance evaluation; Runtime; Sorting; Tree graphs

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DIRECTED GRAPHS; FORESTRY; GEOGRAPHIC INFORMATION SYSTEMS; GRAPHIC METHODS; PROFESSIONAL ASPECTS; SORTING; TREES (MATHEMATICS);

ELECTRONIC SWITCHING SYSTEMS; ENGINEERING PROFESSION; FELLOWS; PERFORMANCE EVALUATION; RUNTIMES; TREE GRAPH;

GRAPH THEORY;

EID: 26444585268     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238200     Document Type: Conference Paper

References (18)

1. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, pages 1116-1127, 1988.
3. L. Arge, G. S. Brodal, and L. Toma. On external memory MST, SSSP, and multi-way planar separators. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 ofLecture Notes in Computer Science, pages 433-447. Springer-Verlag, 2000.
4. L. Arge, U. Meyer, L. Toma, and N. Zeh. On external-memory planar depth first search. InProceedings of the 7th International Workshop on Algorithms and Data Structures, volume 2125 ofLecture Notes in Computer Science, pages 471-482. Springer-Verlag, 2001.
5. To appear in Journal of Graph Algorithms and Applications, 7(2), 2003.
6. L. Arge, L. Toma, and N. Zeh. I/O-efficient algorithms for planar digraphs. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures, pages 85-93, 2003.
7. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 859-860, 2000.
8. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995.
9. E. D. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
10. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16(6):1004-1022, 1987.
11. D. Hutchinson, A. Maheshwari, and N. Zeh. An external memory data structure for shortest path queries. Discrete Applied Mathematics, 126:55-82, 2003.
12. M.-Y. Kao. Planar strong connectivity helps in parallel depth-first search. SIAM Journal on Computing, 24:46-62, 1995.
13. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proceedings of the 8th IEEE Sumposium on Parallel and Distributed Processing, pages 169-176, 1996.
14. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177-189, 1979.
15. A. Maheshwari and N. Zeh. I/O-optimal algorithms for planar graphs using separators. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 372-381, 2002.
16. R. Tamassia and J. S. Vitter. Parallel transitive closure and point location in planar structures. SIAM Journal on Computing, 20(4):708-725, 1991.
17. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.
18. N. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. PhD thesis, School of Computer Science, Carleton University, 2002.