An O(log n log log n) space algorithm for undirected st-connectivity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 626-633

  Trifonov, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

Space complexity; Space bounded computation; Space efficient simulation of parallel algorithms; Undirected st connectivity

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; SET THEORY;

SPACE COMPLEXITY; SPACE-BOUNDED COMPUTATION; SPACE-EFFICIENT SIMULATION OF PARALLEL ALGORITHMS; UNDIRECTED ST-CONNECTIVITY;

ALGORITHMS;

EID: 34848840337     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060684     Document Type: Conference Paper

References (24)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th IEEE Symposium on Foundations of Computer Science, pages 218-223, 1979.
2. 4/3. In 20th ACM Symposium on Theory of Computing, pages 230-239, 1997.
3. B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for ultracomputer and PRAM. In International Conference on Parallel Processing, pages 175-179, 1983.
4. P. Chin, J. Lam, and I.-N. Chen. Efficient parallel algorithms for some graph problems. Communications of the ACM, 25:659-666, 1982.
5. K. Chong, Y. Han, and T. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. Journal of the ACM, 48(2):297-323, 2001.
6. K. Chong and T. Lam. Finding connected components in O (log n log log n.) time on the EREW PRAM. Journal of Algorithms, 18(3):378-402, 1995.
7. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In 27th IEEE Symposium on Foundations of Computer Science, pages 478-491, 1986.
8. H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. In 27th IEEE Symposium on Foundations of Computer Science, pages 492-501, 1986.
9. S. Halperin and U. Zwick. Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. In 7th ACM-SIAM Symposium on Discrete Algorithms, pages 438-447, 1996.
10. D. Hirschberg, A. Chandra, and D. Sarwate. Computing connected components on parallel computers. Communications of the ACM, 22(8):461-464, 1979.
11. 3/2 |V|) parallel time for the CREW PRAM. In 32nd IEEE Symposium on Foundations of Computer Science, pages 688-697, 1991.
12. D. Karger, N. Nisan. and M. Parnas. Fast connected components algorithm for the EREW PRAM. In 4th ACM Symposium on Parallel Algorithms and Architectures, pages 373-381, 1992.
13. M. Koucký. Universal traversal sequences with backtracking. In 16th IEEE Conference on Computational Complexity, pages 21-27, 2001.
14. H. Lewis and C. Papadimitriou. Symmetric space-bounded computation. Theoretical Computer Science, 19:161-187, 1982.
15. N. Nisan. Psuedorandom generators for space-bounded computation. In 22nd ACM Symposium on Theory of Computing, pages 204-212, 1990.
16. 1.5 n) space. In 33rd IEEE Symposium on Foundations of Computer Science, pages 24-29, 1992.
17. S. Pettie and V. Ramachandran. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM Journal on Computing, 31(6):1879-1895, 2002.
18. O. Reingold. Undirected st-connectivity in log-space. In these proceedings, 2005.
19. C. Savage and J. JáJá. Fast, efficient parallel algorithms for some graph problems. SIAM Journal on Computing, 10(4):682-691, 1981.
20. W. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177-192, 1970.
21. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3(1):57-67, 1982.
22. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
23. R. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14(4):862-874, 1985.
24. V. Trifonov. An O(log n log log n) space algorithm for undirected st-connectivity. Technical Report TR04-114, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/, 2004.