On external-memory MST, SSSP and multi-way planar graph separation

Journal of Algorithms

Volumn 53, Issue 2, 2004, Pages 186-206

  Arge, Lars ^a   Brodal, Gerth Stølting ^b   Toma, Laura ^a  

^a Duke University   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; QUEUEING THEORY; SET THEORY; THEOREM PROVING;

BREADTH-FIRST SEARCH (BFS); MINIMUM SPANNING TREE (MST); PLANAR GRAPH SEPARATION; SINGLE SOURCE SHORTEST PATHS (SSSP);

GRAPH THEORY;

EID: 3943090455     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.04.001     Document Type: Article

References (35)

1. Abello J., Buchsbaum A.L., Westbrook J.R. A functional approach to external graph algorithms. Algorithmica. 32:(3):2002;437-458.
2. Agarwal P.K., Arge L., Murali T.M., Varadarajan K., Vitter J.S. I/O-efficient algorithms for contour line extraction and planar graph blocking. Proc. ACM-SIAM Symposium on Discrete Algorithms. 1998;117-126.
3. Aggarwal A., Vitter J.S. The Input/Output complexity of sorting and related problems. Comm. ACM. 31:(9):1988;1116-1127.
4. ARC/INFO, Understanding GIS - the ARC/INFO method, ARC/INFO, 1993, Rev. 6 for workstations.
5. Arge L. The I/O-complexity of ordered binary-decision diagram manipulation. Proc. International Symposium on Algorithms and Computation. Lecture Notes in Comput. Sci. vol. 1004:1995;82-91. A complete version appears as BRICS Technical Report RS-96-29, University of Aarhus.
6. Arge L. The buffer tree: a technique for designing batched external data structures. Algorithmica. 37:(1):2003;1-24.
7. Arge L., Meyer U., Toma L., Zeh N. On external-memory planar depth first search. J. Graph Algorithms Appl. 7:(2):2003;105-129.
8. Arge L., Toma L., Vitter J.S. I/O-efficient algorithms for problems on grid-based terrains. ACM J. Exp. Algorithmics. 6:(1):2001.
9. Borůvka O. O jistém problému minimálním. Práca Moravské Přírodovědecké Společnosti. 3:1926;37-58.
10. Brodal G.S., Katajainen J. Worst-case efficient external-memory priority queues. Proc. Scandinavian Workshop on Algorithms Theory. Lecture Notes in Comput. Sci. vol. 1432:1998;107-118.
11. Buchsbaum A.L., Goldwasser M., Venkatasubramanian S., Westbrook J.R. On external memory graph traversal. Proc. ACM-SIAM Symposium on Discrete Algorithms. 2000;859-860.
12. Buchsbaum A.L., Westbrook J.R. Maintaining hierarchical graph views. Proc. ACM-SIAM Symposium on Discrete Algorithms. 2000;566-575.
13. Chiang Y.-J., Goodrich M.T., Grove E.F., Tamassia R., Vengroff D.E., Vitter J.S. External-memory graph algorithms. Proc. ACM-SIAM Symposium on Discrete Algorithms. 1995;139-149.
14. Chin F., Lam J., Chen I. Efficient parallel algorithms for some graph problems. Comm. ACM. 25:1982;659-665.
15. Cole R., Vishkin U. Approximate parallel scheduling, II. Applications to logarithmic-time optimal parallel graph algorithms. Inform. and Comput. 92:(1):1991;1-47.
16. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
17. Feuerstein E., Marchetti-Spaccamela A. Memory paging for connectivity and path problems in graphs. Proc. International Symposium on Algorithms and Computation. Lecture Notes in Comput. Sci. vol. 762:1993;416-425.
18. Frederickson G.N. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16:1987;1004-1022.
19. Goodrich M. Planar separators and parallel polygon triangulation. J. Comput. System Sci. 51:(3):1995;374-389.
20. Hutchinson D., Maheshwari A., Zeh N. An external-memory data structure for shortest path queries. Proc. Annual Combinatorics and Computing Conference. Lecture Notes in Comput. Sci. vol. 1627:1999;51-60.
21. JáJá J.F. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading, MA. Chapter 5, pp. 222-227.
22. Knuth D.E. Sorting and Searching. The Art of Computer Programming, vol. 3. second ed. 1998;Addison-Wesley, Reading, MA.
23. Kozen D. The Design and Analysis of Algorithms. 1992;Springer, Berlin.
24. Kumar V., Schwabe E. Improved algorithms and data structures for solving graph problems in external memory. Proc. IEEE Symposium on Parallel and Distributed Processing. 1996;169-177.
25. Lipton R.J., Tarjan R.E. A separator theorem for planar graphs. SIAM J. Appl. Math. 36:1979;177-189.
26. Maheshwari A., Zeh N. External memory algorithms for outerplanar graphs. Proc. International Symposium on Algorithms and Computation. Lecture Notes in Comput. Sci. vol. 1741:1999;307-316.
27. Maheshwari A., Zeh N. I/O-efficient algorithms for graphs of bounded treewidth. Proc. ACM-SIAM Symposium on Discrete Algorithms. 2001;89-90.
28. Maheshwari A., Zeh N. I/O-optimal algorithms for planar graphs using separators. Proc. ACM-SIAM Symposium on Discrete Algorithms. 2002;372-381.
29. Mehlhorn K., Meyer U. External-memory breadth-first search with sublinear I/O. Proc. European Symposium on Algorithms. Lecture Notes in Comput. Sci. vol. 2461:2002;723-735.
30. Munagala K., Ranade A. I/O-complexity of graph algorithms. Proc. ACM-SIAM Symposium on Discrete Algorithms. 1999;687-694.
31. Nodine M.H., Goodrich M.T., Vitter J.S. Blocking for external graph searching. Algorithmica. 16:(2):1996;181-214.
32. Reif J.H. Synthesis of Parallel Algorithms. 1993;Morgan Kaufmann.
33. Tarjan R.E. Data Structures and Network Algorithms. 1983;SIAM, Philadelphia, PA.
34. L. Toma, External memory graph algorithms and applications to geographic information systems, PhD thesis, Duke University, 2003.
35. Ullman J.D., Yannakakis M. The input/output complexity of transitive closure. Ann. Math. Artif. Intell. 3:1991;331-360.