The diameter of randomly perturbed digraphs and some applications

Random Structures and Algorithms

Volumn 30, Issue 4, 2007, Pages 484-504

  Flaxman, Abraham D ^a   Frieze, Alan M ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Digraphs; k linked; Smoothed analysis; Strong connectivity

Indexed keywords

EID: 34547249887     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20172     Document Type: Article

References (30)

1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, "Random walks, traversal sequences, and the complexity of maze problems," In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, 1979, pp. 218-223.
2. N. Alon, A. Gyárfás, and M. Ruszinkó, Decreasing the diameter of bounded degree graphs, J Graph Theory 35 (2000), 161-172.
3. N. Alon and N. Kahale, "A spectral technique for coloring random 3-colorable graphs," SIAM Journal on Computing 26 (1997), 1733-1748.
4. L. Bechetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer, and T. Vredeveld, "Smoothening helps: A probabilistic analysis of the multi-level feedback algorithm," Presented at FOCS03, 2003.
5. R. Beier and B. Vöcking, "Typical properties of winners and losers in discrete optimization," In Proceedings of the 36th annual ACM Symposium on Theory of Computing, New York, ACM, 2004, pp. 343-352.
6. A. Blum and J. Spencer, Coloring random and semi-random k-colorable graphs, J Algorithms 19 (1995), 204-234.
7. T. Bohman, A. M. Frieze, M. Krivelevich, and R. Martin, Adding random edges to dense graphs, Random Struct Algorithms 24 (2004), 105-117.
8. T. Bohman, A. M. Frieze, and R. Martin, How many random edges make a dense graph Hamiltonian? Random Struct Algorithms 22 (2003), 33-42.
9. B. Bollobás, Random graphs, 2nd ed., Cambridge University Press, Cambridge, 2001.
10. B. Bollobás and F. Chung, The diameter of a cycle plus a random matching, SIAM J Discrete Math 1 (1988), 328-333.
11. F. Chung and M. Garey, Diameter bounds for altered graphs, J Graph Theory 8 (1984), 511-534.
12. C. Cooper and A. M. Frieze, The size of the largest strongly connected component of a random digraph with a given degree sequence, Combinatorics Probability Comput 13 (2004), 319-338.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On powerlaw relationships of the Internet topology, SIGCOMM 99 (1999), 251-262.
14. U. Feige, A tight upper bound on the cover time for random walks on graphs, Random Struct Algorithms 6 (1995), 51-54.
15. U. Feige and J. Kilian, Heuristics for semirandom graph problems, J Comput Syst Sci 63 (2001), 639-671.
16. [16) U. Feige and R. Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph, Random Struct Algorithms 16 (2000), 195-208.
17. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J ACM 45 (1998), 653-750.
18. O. Goldreich and D. Ron, "Property testing in bounded degree graphs," In Proceedings of the 29th STOC, 1997, pp. 406-415.
19. S. Janson, T. Luczak, and A. Ruciński, Random graphs, Wiley-Interscience, New York, 2000.
20. N. D. Jones, Space-bounded reducibility among combinatorial problems, J Comput Syst Sci 11 (1975), 68-75.
21. R. Karp, The transitive closure of a random digraph, Random Struct Algorithms 1 (1990), 73-94.
22. M. Krivelevich, B. Sudakov, and P. Tetali, On smoothed analysis in dense graphs and formulas, Random Struct Algorithms 29 (2006), 180-193.
23. N. Nisan, On read-once vs. multiple access randomness in logspace, Theor Comput Sci 107 (1993), 135-144.
24. O. Reingold, "Undirected ST-connectivity in log-space," In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 376-385.
25. M. Santha and U. Vazirani, Generating quasi-random sequences from semi-random sources, J Comput Syst Sci 33 (1986), 75-87.
26. M. Sipser, Introduction to the theory of computation, 2nd ed., Course Technology, Boston, 2005.
27. D. Spielman and S. H. Teng, "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time," In Proceedings of the the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 296-305.
28. D. Spielman and S. H. Teng, "Smoothed analysis: Motivation and discrete models," In Proceedings of WADS 2003, Lecture notes in computer science, Springer-Verlag, Berlin, 2003, pp. 256-270.
29. C. R. Subramanian, M. Fürer, and C. E. Veni, Madhavan, Algorithms for coloring semi-random graphs, Random Struct Algorithms 13 (1998), 125-158.
30. H. Vollmer and K. W. Wagner, "Measure one results in computational complexity theory," Advances in algorithms, languages, and complexity, D.-Z. Du and K.-I. Ko (Editors), Kluwer Academic Publishers, Dordrecht, 1997, pp. 285-312.