External connected components

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

Volumn 3111, Issue , 2004, Pages 468-479

  Sibeyn, Jop F ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Connected Components; External Algorithms; Graph Problems; List Ranking; Tree Rooting

Indexed keywords

FORESTRY; GRAPH THEORY; TREES (MATHEMATICS);

CONNECTED COMPONENT; EXPECTED RUNNING TIME; GRAPH PROBLEMS; INVOLVED NODES; LIST RANKINGS; NODE INDICES; RANDOM GRAPHS; TREE ROOTING;

ALGORITHMS;

EID: 35048816089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_40     Document Type: Article

References (14)

1. Abello, J., A.L. Buchsbaum, J. R. Westbrook, 'A Functional Approach to External Graph Algorithms,' Proc. 6th European Symposium on Algorithms, LNCS 1461, pp. 332-343, 1998.
2. Full version AT & T Research Report, TR 99.1.1., 1999.
3. Anderson, R.J., G.L. Miller, 'Deterministic Parallel List Ranking', Algorithmica, 6, pp. 859-868, 1991.
4. Arge, L., G. Brodal, L. Toma, 'On External Memory MST, SSSP and Multi-Way Planar Graph Separation,' Proc. 7th Scandinavian Workshop on Algorithm Theory, LNCS 1851, pp. 433-447, Springer-Verlag, 2000.
5. Chiang, Y-J, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter, 'External-Memory Graph Algorithms,' Proc. 6th Symposium on Discrete Algorithms, pp. 139-149, ACM-SIAM, 1995.
6. Chin, F.Y., J. Lam, I. Chen, 'Efficient Parallel Algorithms for some Graph Problems,' Communications of the ACM, 25(9), pp. 659-665, 1982.
7. Crauser A., K. Mehlhorn, 'Lecture notes on algorithms for very large data sets (1997),' http://www.mpi-sb.mpg.de/∼crauser/courses.html
8. Hirschberg, D.S., A.K. Chandra, D.V. Sarwate, 'Computing Connected Components on Parallel Computers,' Communications of the ACM, 22(8), pp. 461-464, 1979.
9. Karger, D.R., P.N. Klein, R.E. Tarjan, 'A randomized linear-time algorithm to find minimum spanning trees.', Journal of the ACM, 42(2):321-328, 1995.
10. Meyer, U., P. Sanders, J.F. Sibeyn (Eds.), Tutorial on Algorithms for Memory Hierarchies, LNCS 2625, Springer-Verlag, 2003.
11. Munagala, K., A. Ranade, 'I/O-Complexity of Graph Algorithms,' 10th Symposium on Discrete Algorithms, ACM-SIAM, pp. 687-694, 1999.
12. Sibeyn, J.F., 'Ultimate Parallel List Ranking?,' Proc. 6th Conference on High Performance Computing, LNCS, Springer-Verlag, 1999.
13. Full version Techn. Rep. MPI-I-99-1005, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1999.
14. Vitter, J.S., 'External Memory Algorithms and Data Structures: Dealing with Massive Data,' ACM Computing Surveys, 33(2), pp. 209-271, 2001.