Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

Information and Computation

Volumn 130, Issue 2, 1996, Pages 101-129

  Beame, Paul ^a   Borodin, Allan ^b   Raghavan, Prabhakar ^c   Ruzzo, Walter L ^a   Tompa, Martin ^a  

^a University of Washington   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013478591     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0085     Document Type: Article

References (53)

1. Adleman, L. M. (1978), Two theorems on random polynomial time, in "19th Annual Symposium on Foundations of Computer Science, Ann Arbor, MI," pp. 75-83, IEEE.
2. Aleliunas, R., Karp, R. M., Lipton, R. J., Lovász, L., and Rackoff, C. W. (1979), Random walks, universal traversal sequences, and the complexity of maze problems, in "20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico," pp. 218-223, IEEE.
3. Alon, N., Azar, Y., and Ravid, Y. (1990), Universal sequences for complete graphs, Discrete Appl. Math. 27, 25-28.
4. Bar-Noy, A., Borodin, A., Karchmer, M., Linial, N., and Werman, M. (1989), Bounds on universal sequences, SIAM J. Comput. 18 (2), 268-277.
5. Barnes, G., Buss, J. F., Ruzzo, W. L., and Schieber, B. (1992), A sublinear space, polynomial time algorithm for directed s-t connectivity, in "Proceedings, Structure in Complexity Theory, Seventh Annual Conference, Boston," pp. 27-33, IEEE; SIAM J. Comp., to appear.
6. Barnes, G., Buss, J. F., Ruzzo, W. L., and Schieber, B. (1992), A sublinear space, polynomial time algorithm for directed s-t connectivity, in "Proceedings, Structure in Complexity Theory, Seventh Annual Conference, Boston," pp. 27-33, IEEE; SIAM J. Comp., to appear.
7. Barnes, G., and Edmonds, J. A. (1993), Time-space lower bounds for directed s-t connectivity on JAG models, in "Proceedings 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA," pp. 228-237, IEEE.
8. Barnes, G., and Feige, U. (1993), Short random walks on graphs, in "Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego," pp. 728-737.
9. Barnes, G., and Ruzzo, W. L. (1991), Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space, in "Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, New Orleans," pp. 43-53; Comput. Complexity, to appear.
10. Barnes, G., and Ruzzo, W. L. (1991), Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space, in "Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, New Orleans," pp. 43-53; Comput. Complexity, to appear.
11. Beame, P. W., Borodin, A., Raghavan, P., Ruzzo, W. L., and Tompa M. (1990), Time-space tradeoffs for undirected graph traversal, in "Proceedings 31st Annual Symposium on Foundations of Computer Science, St. Louis," pp. 429-438, IEEE.
12. Beame, P. W., Borodin, A., Raghavan, P., Ruzzo, W. L., and Tompa, M., A time-space tradeoff for undirected graph traversal by walking automata, SIAM J. Comput., to appear.
13. Berman, P., and Simon, J. (1983), Lower bounds on graph threading by probabilistic machines, in "24th Annual Symposium on Foundations of Computer Science, Tucson, AZ," pp. 304-311, IEEE.
14. Blum, M., and Kozen, D. C. (1978), On the power of the compass (or, why mazes are easier to search than graphs), in "19th Annual Symposium on Foundations of Computer Science, Ann Arbor, MI," pp. 132-142, IEEE.
15. Blum, M., and Sakoda, W. J. (1977), On the capability of finite automata in 2 and 3 dimensional space, in "18th Annual Symposium on Foundations of Computer Science, Providence, RI," pp. 147-161, IEEE.
16. Bollobás, B. (1986), "Extremal Graph Theory with Emphasis on Probabilistic Methods," Regional Conference Series in Mathematics, Vol. 62, published for the Conference Board of the Mathematical Sciences by the American Mathematical Society.
17. Bondy, J. A., and Murty, U. S. R. (1976), "Graph Theory with Applications," MacMillan Co., New York; revised paperback edition, 1977.
18. Borodin, A. (1982), Structured vs. general models in computational complexity, Enseign. Math. 28, 171-190; also in [39, pp. 47-65].
19. Borodin, A., Cook, S. A., Dymond, P. W., Ruzzo, W. L., and Tompa, M. (1989), Two applications of inductive counting for complementation problems, SIAM J. Comput. 18 (3), 559-578; see also 18 (6), 1283.
20. Borodin, A., Cook, S. A., Dymond, P. W., Ruzzo, W. L., and Tompa, M. (1989), Two applications of inductive counting for complementation problems, SIAM J. Comput. 18 (3), 559-578; see also 18 (6), 1283.
21. Borodin, A., Ruzzo, W. L., and Tompa, M. (1992), Lower bounds on the length of universal traversal sequences, J. Comput. System Sci. 45, 180-203.
22. Bridgland, M. F. (1987), Universal traversal sequences for paths and cycles, J. Algorithms 8, 395-404.
23. Broder, A. Z., Karlin, A. R., Raghavan, P., and Upfal, E. (1994), Trading space for time in undirected s-t connectivity, SIAM J. Comput. 23 (2), 324-334.
24. Buss, J., and Tompa, M. (1995), Lower bounds on universal traversal sequences based on chains of length five, Inform. and Comput. 120, 326-329.
25. Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., and Tiwari, P. (1989), The electrical resistance of a graph captures its commute and cover times, in "Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle," pp. 574-586.
26. Cobham, A. (1966), "The Recognition Problem for the Set of Perfect Squares," Research Paper RC-1704, IBM Watson Research Center.
27. Cook, S. A., and Rackoff, C. W. (1980), Space lower bounds for maze threadability on restricted machines, SIAM J. Comput. 9 (3), 636-652.
28. Dill, D. L., Drexler, A. J., Hu, A. J., and Yang, C. H. (1992), Protocol verification as a hardware design aid, in "IEEE International Conference on Computer Design: VLSI in Computers and Processors," pp. 522-525.
29. Edmonds, J. A. (1993), Time-space trade-offs for undirected ST-connectivity on a JAG, in "Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego," pp. 718-727.
30. Edmonds, J. A., and Poon, C. K. (1995), A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model, in "Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, Las Vegas," pp. 147-156.
31. Feige, U. (1993), A randomized time-space tradeoff of Õ(mR̂) for USTCON, in "Proceedings 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA," pp. 238-246, IEEE.
32. Hall, P. (1935), On representatives of subsets, J. London Math. Soc. 10, 26-30.
33. Hemmerling, A. (1989), "Labyrinth Problems: Labyrinth-Searching Abilities of Automata," Teubner-Texte zur Mathematik, Vol. 114, Teubner, Leipzig.
34. Herstein, I. N. (1975), "Topics in Algebra," 2nd ed., Wiley, New York.
35. Hoory, S., and Wigderson, A. (1993), Universal traversal sequences for expander graphs, Inform. Process. Lett. 46 (2), 67-69.
36. Immerman, N. (1988), Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (5), 935-938.
37. Istrail, S. (1988), Polynomial universal traversing sequences for cycles are constructible, in "Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago," pp. 491-503.
38. Istrail, S. (1990), Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter, in "Proceedings 31st Annual Symposium on Foundations of Computer Science, St. Louis," pp. 439-448, IEEE.
39. Kahn, J. D., Linial, N., Nisan, N., and Saks, M. E. (1989), On the cover time of random walks on graphs, J. Theoret. Probab. 2 (1), 121-128.
40. O(log n) for cliques, Inform. Process. Lett. 28, 241-243.
41. Kurshan, R. P. (1994), The complexity of verification, in "Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montreal," pp. 365-371.
42. "Logic and Algorithmic, An International Symposium Held in Honor of Ernst Specker, Zürich, 1980," Monographie No. 30 de L'Enseignement Mathématique, Université de Genève, 1982.
43. Mauldin, M. L., and Leavitt, J. R. R. (1994), Web-agent related research at the Center for Machine Translation, in "Proceedings of the ACM Special Interest Group on Networked Information Discovery and Retrieval (SIGNIDR-94)."
44. Nisan, N. (1994), RC⊆SC, Comput. Complexity 4 (1), 1-11.
45. 1.5n) space, in "Proceedings 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh," pp. 24-29, IEEE.
46. Nisan, N., and Ta-Shma, A. (1995), Symmetric Logspace is closed under complement, Chicago J. Theoret. Comput. Sci. 1995 (1).
47. Savitch, W. J. (1970), Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4, 177-192.
48. Savitch, W. J. (1973), Maze recognizing automata and nondeterministic tape complexity, J. Comput. System Sci. 7, 389-403.
49. Selberg, E., and Etzioni, O. (1995), Multi-engine search and comparison using the Metacrawler, in "World Wide Web Journal: Fourth International World Wide Web Conference Proceedings," pp. 195-208.
50. Szelepcsényi, R. (1988), The method of forcing for nondeterministic automata, Acta Informat. 26, 279-284.
51. Tompa, M. (1982), Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations, SIAM J. Comput. 11 (1), 130-137.
52. Tompa, M. (1992), Lower bounds on universal traversal sequences for cycles and other low degree graphs, SIAM J. Comput. 21 (6), 1153-1160.
53. Zuckerman, D. I. (1991), On the time to traverse all edges of a graph, Inform. Process. Lett. 38 (6), 335-337.