External-memory graph algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 139-149

  Chiang, Yi Jen ^a   Goodrich, Michael T ^b   Grove, Edward F ^c   Tamassia, Roberto ^a   Vengroff, Darren Erik ^a   Vitter, Jeffrey Scott ^c  

^a BROWN UNIVERSITY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); TOPOLOGY;

BICONNECTED COMPONENTS; CENTROID DECOMPOSITION; CONNECTED COMPONENT; EXTERNAL MEMORY ALGORITHMS; LEAST COMMON ANCESTORS; MINIMUM SPANNING FORESTS; MINIMUM SPANNING TREES; VISIBILITY REPRESENTATION;

PROBLEM SOLVING;

EID: 84994666437     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
2. R. J. Anderson and G. L. Miller. A simple randomized parallel algorithm for list-ranking. Info. Proc. Letters, 33(5):269-273, 1990.
3. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. Technical report, Institue for Advanced Computer Studies, Univ. of Maryland, College Park, 1990.
4. F. Y. Chin, J. Lam, and I. Chen. Efficient parallel algorithms for some graph problems. Comm. of the ACM, 25(9):659-665, 1982.
5. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal list-ranking. Information and Control, 70(l):32-53, 1986.
6. T. H. Cormen. Virtual Memory for Data Parallel Computing. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1992.
7. T. H. Cormen. Fast permuting in disk arrays. Journal of Parallel and Distributed Computing, 17(l-2):41-57, Jan./Feb. 1993.
8. T. H. Cormen, T. Sundquist, and L. F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. Technical Report PCS-TR94-223, Dartmouth College Dept. of Computer Science, July 1994.
9. E. Feuerstein and A. Marchetti-Spaccamela. Memory paging for connectivity and path problems in graphs. In Proc. Int. Symp. on Algorithms and Comp., 1993.
10. P. G. Franciosa and M. Talamo. Orders, implicit fc-sets representation and fast halfplane searching. In Proc. Workshop on Orders, Algorithms and Applications (ORDAL'94), pages 117-127, 1994.
11. M. T. Goodrich, M. H. Nodine, and J. S. Vitter. Blocking for external graph searching. In Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Sys., pages 222-232, 1993.
12. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In IEEE Foundations of Comp. Sci., pages 714-723, 1993.
13. D. R. Karger. Global min-cuts in RNC and other ramifications of a simple mincut algorithm. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 21-30, 1993.
14. V. King. A simpler minimum spanning tree verification algorithm, 1994.
15. P. Klein and R. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees. In Proc. ACM Symp. on Theory of Computing, 1994.
16. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs, Int. Symp. (Rome, 1966), pages 215-232. Gordon and Breach, New York, 1967.
17. Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search and st-numbering in graphs. Theoretical Computer Science, 47(3):277-296, 1986.
18. M. H. Nodine and J. S. Vitter. Deterministic distribution sort in shared and distributed memory multiprocessors. In Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, June 1993.
19. M. H. Nodine and J. S. Vitter. Paradigms for optimal sorting with multiple disks. In Proc. of the 26th Hawaii Int. Conf. on Systems Sciences, Jan. 1993.
20. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Comp., 27(3): 17-28, Mar. 1994.
21. R. Tamassia and J. S. Vitter. Optimal cooperative search in fractional cascaded data structures. In Proc. 2nd ACM Symosium on Parallel Algorithms and Architectures, pages 307-316, 1990.
22. R. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. SIAM J. Computing, 14(4):862-874, 1985.
23. J. D. Ullman and M. Yannakakis. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intellegence, 3:331-360, 1991.
24. D. E. Vengroff. A transparent parallel I/O environment. In Proc. 1994 DAGS Symposium on Parallel Computation, July 1994.
25. U. Vishkin. Personal communication, 1992.
26. J, S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2), 1994.
27. B. Zhu. Further computational geometry in secondary memory. In Proc. Int. Symp. on Algorithms and Computation, 1994.