A functional approach to external graph algorithms

Algorithmica (New York)

Volumn 32, Issue 3, 2002, Pages 437-458

  Abello, J ^a   Buchsbaum, A L ^a   Westbrook, J R ^b  

^a AT AND T LABS RESEARCH   (United States)

^b 20th Century Television ^*  (United States)

Author keywords

Connected components; External memory algorithms; Functional programming; Graph algorithms; Maximal independent sets; Maximal matchings; Minimum spanning trees

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DATA STORAGE EQUIPMENT; RANDOM ACCESS STORAGE; THEOREM PROVING; TREES (MATHEMATICS);

EXTERNAL GRAPH ALGORITHMS;

ALGORITHMS;

EID: 0141922822     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0088-5     Document Type: Article

References (40)

1. J. Abello and J. S. Vitter, editors. External Memory Algorithms, volume 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, 1999.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31 (8): 1116-27, 1988.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
4. L. Arge. The buffer tree: a new technique for optimal I/O algorithms. In Proc. 4th Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 334-45. Springer-Verlag, Berlin, 1995.
5. L. Arge. Efficient External-Memory Data Structures and Applications. Ph.D. thesis, Dept. of Computer Science, University of Aarhus, 1996.
6. L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of Geographic Information Systems, volume 1340 of Lecture Notes in Computer Science, pages 213-54. Springer-Verlag, Berlin, 1997.
7. O. Borůvka. O jistém problému minimálním. Práce Moravské Přírodovédecké Společnosti v Brně (Acta Societ. Science. Natur. Moravicae), 3:37-58, 1926.
8. G. S. Brodai and J. Katajainen. Worst-case efficient external-memory priority queues. In Proc. 6th Scandinavian Workshop on Algorithm Theory, volume 1432 of Lecture Notes in Computer Science, pages 107-18. Springer-Verlag, Berlin, 1998.
9. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pages 859-60, 2000.
10. P. M. Camerini. The min-max spanning tree problem and some extensions. Information Processing Letters, 7:10-14, 1978.
11. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-54, 1979.
12. Y.-J. Chiang. Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results. Ph.D. thesis, Dept. of Computer Science, Brown University, 1995.
13. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pages 139-49, 1995.
14. F. Y. Chin, J. Lam, and I.-N. Chen. Efficient parallel algorithms for some graph problems. Communications of the ACM, 25(9):659-65, 1982.
15. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, February 1989.
16. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. Journal of the ACM, 44(5):669-96, 1997.
17. R. Fadel, K. V. Jakobsen, J. Katajainen, and J. Teuhola. Heaps and heapsort on secondary storage. Theoretical Computer Science, 220(2):354-62, 1999.
18. A. Israeli and A. Itai. A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters, 22:77-80, 1986.
19. A. Israeli and Y. Shiloach. An improved parallel algorithm for maximal matching. Information Processing Letters, 22:57-60, 1986.
20. J. Ja'Ja. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
21. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42(2):321-28, 1995.
22. R. M. Karp. Probabilistic recurrence relations. Journal of the ACM, 41(6):1136-50, 1994.
23. R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. Journal of the ACM, 32(4):762-73, 1985.
24. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley, Reading, MA, 1973.
25. J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:53-57, 1956.
26. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th IEEE Symposium on Parallel and Distributed Processing, pages 169-76, 1996.
27. M. J. Litzkow and M. Livny. Making workstations a friendly environment for batch jobs. In Proc. 3rd Workshop on Workstation Operating Systems, pages 62-67, April 1992.
28. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4): 1036-53, 1986.
29. Y. Matias, E. Segal, and J. S. Vitter. Efficient bundle sorting. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pages 839-48, 2000.
30. K. Mehlhorn. Personal communication. http://www.mpi-sb.rapg.de/~crauser/courses. html, 1998.
31. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, pages 687-94, 1999.
32. J. S. Plank, M. Beck, G. Kingsley, and K. Li. Libckpt: transparent checkpointing under UNIX. In Proc. USENIX Winter 1995 Technical Conference, pages 213-23, 1995.
33. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-91, 1983.
34. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM, 31(2):245-81, 1984.
35. J. D. Ullman and M. Yannakakis. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intelligence, 3(2-4):331-60, 1991.
36. J. S. Vitter. External memory algorithms. In Proc. 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 119-28, 1998.
37. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-48, 1990.
38. Y.-M. Wang, Y. Huang, K.-P. Vo, P.-Y. Chung, and C. Kintala. Checkpointing and its applications. In Proc. 25th IEEE International Symposium on Fault Tolerant Computing, pages 22-31, 1995.
39. D. J. A. Welsh. Matroid Theory. Academic Press, New York, 1976.
40. S. B. Yang, S. K. Dhall, and S. Lakshmivarahan. Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. In Proc. IEEE SOUTHEASTCON '91, volume 1, pages 579-81, 1991.