On external-memory planar depth-first search

Journal of Graph Algorithms and Applications

Volumn 7, Issue 2, 2003, Pages 105-129

  Arge, Lars ^a   Meyer, Ulrich ^b   Toma, Laura ^a   Zeh, Norbert ^c  

^a Duke University   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3943055626     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00063     Document Type: Conference Paper

References (30)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002.
2. P. Agarwal, L. Arge, M. Murali, K. Varadarajan, and J. Vitter. I/O-efficient algorithms for contour-line extraction and planar graph blocking. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 117-126, 1998.
3. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, pages 1116-1127, September 1988.
4. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. In Proceedings of the Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 334-345, 1995.
5. L. Arge. The I/O-complexity of ordered binary-decision diagram manipulation. In Proceedings of the International Symposium on Algorithms and Computation, volume 1004 of Lecture Notes in Computer Science, pages 82-91, 1995.
6. L. Arge, G. S. Brodal, and L. Toma. On external memory MST, SSSP, and multi-way planar separators. In Proc. Scandinavian Workshop on Algorithms Theory 2000, volume 1851 of Lecture Notes in Computer Science, pages 433-447, 2000.
7. L. Arge and U. Meyer and L. Toma and N. Zeh. On External-Memory Planar Depth First Search, In Proceedings of the Workshop on Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pages 471-482, 2001.
8. L. Arge, L. Toma, and J. Vitter. I/O-efficient algorithms for problems on grid-based terrains. In Proceedings of the Workshop on Algorithm Engineering and Experimentation, 2000.
9. A. Broder, R. Kumar, F. Manghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: Experiments and models. In Proceedings of the ninth WWW Conference, 2000. Available at http://www9.org/w9cdrom/index.html.
10. A. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 859-860, 2000.
11. A. L. Buchsbaum and J. R. Westbrook. Maintaining hierarchical graph views. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 566-575, 2000.
12. 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.
13. F. Chin, J. Lam, and I. Chen. Efficient parallel algorithms for some graphs problems. Communications of the ACM, 25(9):659-665, 1982.
14. E. Feuerstein and A. Marchetti-Spaccamela. Memory paging for connectivity and path problems in graphs. In Proceedings of the International Symposium on Algorithms and Computation, pages 416-425, 1993.
15. T. Hagerup. Planar depth-first search in O(log n) parallel time. SIAM Journal on Computing, 19(4):678-704, 1990.
16. D. Hutchinson, A. Maheshwari, and N. Zeh. An external memory data structure for shortest path queries. In Proceedings of the 5th ACM-SIAM Computing and Combinatorics Conference, volume 1627 of Lecture Notes in Computer Science, pages 51-60, 1999. To appear in Discrete Applied Mathematics.
17. J. JáJá and R. Kosaraju. Parallel algorithms for planar graph isomorphism and related problems. IEEE Transactions on Circuits and Systems, 35(3):304-311, 1988.
18. J. F. JáJá. An introduction to parallel algorithms, chapter 5, pages 222-227. Addison-Wesley, Reading, MA, 1992.
19. 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 Computing, pages 169-177, 1996.
20. A. Maheshwari and N. Zeh. External memory algorithms for outerplanar graphs. In Proceedings of the 10th International Symposium on Algorithms and Computation, volume 1741 of Lecture Notes in Computer Science, pages 307-316. Springer Verlag, December 1999.
21. A. Maheshwari and N. Zeh. I/O-efficient algorithms for graphs of bounded treewidth. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 89-90, 2001.
22. 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.
23. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In Proceedings of the 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 723-735, 2002.
24. U. Meyer. External memory BFS on undirected graphs with bounded degree. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 87-88, 2001.
25. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, 32:265-279, 1986.
26. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 687-694, 1999.
27. J. R. Smith. Parallel algorithms for depth-first searches I. planar graphs. SIAM Journal on Computing, 15(3):814-830, 1986.
28. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-159, 1972.
29. R. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. SIAM Journal on Computing, 14(4):862-874, 1985.
30. U. Ullman and M. Yannakakis. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intellligence, 3:331-360, 1991.