The Euler tour technique and parallel rooted spanning tree

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2004, Pages 448-457

  Cong, Guojing ^a   Bader, David A ^a  

^a University of New Mexico   (United States)

Author keywords

Euler Tour; High Performance Algorithm Engineering; Parallel Graph Algorithms; Shared Memory; Spanning Tree

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

EULER TOUR; HIGH-PERFORMANCE ALGORITHM ENGINEERING; PARALLEL GRAPH ALGORITHMS; SHARED MEMORY; SPANNING TREE;

PARALLEL PROCESSING SYSTEMS;

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

References (15)

1. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, April 2004.
2. S. Chung and A. Condon. Parallel implementation of Borůvka's minimum spanning tree algorithm. In Proc. 10th Int'l Parallel Processing Symp. (IPPS'96), pages 302-315, April 1996.
3. S. Goddard, S. Kumar, and J.F. Prins. Connected components algorithms for mesh-connected parallel computers. In S. N. Bhatt, editor, Parallel Algorithms: 3rd DIMACS Implementation Challenge October 17-19, 1994, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43-58. American Mathematical Society, 1997.
4. J. Greiner. A comparison of data-parallel algorithms for connected components. In Proc. 6th Ann. Symp. Parallel Algorithms and Architectures (SPAA-94), pages 16-25, Cape May, NJ, June 1994.
5. D. R. Helman and J. JáJá. Designing practical efficient algorithms for symmetric multiprocessors. In Algorithm Engineering and Experimentation (ALENEX'99), volume 1619 of Lecture Notes in Computer Science, pages 37-56, Baltimore, MD, January 1999. Springer-Verlag.
6. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate. Computing connected components on parallel computers. Commununications of the ACM, 22(8):461-464, 1979.
7. T.-S. Hsu, V. Ramachandran, and N. Dean. Parallel implementation of algorithms for finding connected components in graphs. In S. N. Bhatt, editor, Parallel Algorithms: 3rd DIMACS Implementation Challenge October 17-19, 1994, volume 30 of DIMACS Series in Discrete Mathemat-ics and Theoretical Computer Science, pages 23-41. American Mathematical Society, 1997.
8. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992.
9. A. Krishnamurthy, S. S. Lumetta, D. E. Culler, and K. Yelick. Connected components on distributed memory machines. In S. N. Bhatt, editor, Parallel Algorithms: 3rd DIMACS Implementation Challenge October 17-19, 1994, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1-21. American Mathematical Society, 1997.
10. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
11. B.M.E. Moret and H.D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics 15, pages 99-117. American Mathematical Society, 1994.
12. S. Pettie and V. Ramachandran. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput., 31(6):1879-1895, 2002.
13. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algs., 3(1):57-67, 1982.
14. R.E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Computing, 14(4):862-874, 1985.
15. J. van Leeuwen, editor. Handbook of Theoretical Computer Science. The MIT Press/Elsevier, New York, 1990.