A functional approach to external graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 332-343

  Abello, James ^a   Buchsbaum, Adam L ^a   Westbrook, Jeffery R ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

CONNECTED COMPONENT; EXTERNAL GRAPHS; FUNCTIONAL APPROACH; MAXIMAL MATCHINGS; MINIMUM SPANNING TREES; OPTIMIZATION TECHNIQUES; PURELY FUNCTIONAL; UNDIRECTED GRAPH;

FUNCTIONAL PROGRAMMING;

EID: 84896746147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_28     Document Type: Conference Paper

References (22)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. C. ACM, 31(8): 1116-27, 1988.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
3. L. Arge. The buffer tree: A new technique for optimal I/O algorithms. In Proc. 4th WADS, Volume 955 of LNCS, pages 334-45. Springer-Verlag, 1995.
4. O. Boruvka. O jistém problému minimálnm. Práce Mor. Prrodoved. Spol. v Brne, 3: 37-58, 1926.
5. P. M. Camerini. The min-max spanning tree problem and some extensions. IPL, 7: 10-4, 1978.
6. J. L. Carter and M. N. Wegman. Universal classes of hash functions. JCSS, 18: 143-54, 1979.
7. Y.-J. Chiang. Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Problems: Theoretical and Experimental Results. PhD thesis, Dept. of Comp. Sci., Brown Univ., 1995.
8. 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 SODA, pages 139-49, 1995.
9. F. Y. Chin, J. Lam, and I.-N. Chen. Efficient parallel algorithms for some graph problems. C. ACM, 25(9): 659-65, 1982.
10. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. JCSS, 38(1): 86-124, February 1989.
11. J. Ja'Ja. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
12. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. ACM, 42(2): 321-28, 1995.
13. R. M. Karp. Probabilistic recurrence relations. J. ACM, 41(6): 1136-50, 1994.
14. P. Kelsen. An optimal parallel algorithm for maximal matching. IPL, 52(4): 223-8, 1994.
15. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th IEEE SPDP, pages 169-76, 1996.
16. M. J. Litzkow and M. Livny. Making workstations a friendly environment for batch jobs. In Proc. 3rd Wks. on Work. Oper. Sys., April 1992.
17. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comp., 15: 1036-53, 1986.
18. K. Mehlhorn. Personal communication. http://www.mpi-sb.mpg.de/crauser/ courses.html, 1998.
19. J. S. Plank, M. Beck, G. Kingsley, and K. Li. Libckpt: Transparent checkpointing under UNIX. In Proc. Usenix Winter 1995 Tech. Conf., pages 213-23, 1995.
20. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. JCSS, 26(3): 362-91, 1983.
21. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. ACM, 31(2): 245-81, 1984.
22. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theor. Comp. Sci., 73: 231-48, 1990.