Testing the diameter of graphs

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

Volumn 1671, Issue , 1999, Pages 85-96

  Parnas, Michal ^a   Ron, Dana ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES;

BOUNDED-DEGREE MODELS; DIAMETER OF GRAPHS; GENERAL MODEL; GRAPH PROPERTIES; TIME POLYNOMIALS;

APPROXIMATION ALGORITHMS;

EID: 35048818808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_9     Document Type: Conference Paper

References (12)

1. N. Alon, A. Gyárfás, and M. Ruszinkó. Decreasing the diameter of bounded degree graphs. To appear in Journal of Graph Theory, 1999.
2. B. Awerbuch and D Peleg. Sparse partitions. In Proceedings of the Thirty- First Annual Symposium on Foundations of Computer Science, pages 503-513, 1990.
3. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 1992.
4. B. Awerbuch. Complexity of network synchronization. Journal of the Asso- ciation for Computing Machinery, 32:804-823, 1985.
5. M. E. Dyer and A. M. Frieze. A simple heuristic for the p-centre problem. Operations Research Letters, 3(6):285-288, 1985.
6. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the Association for Computing Machinery, 45(4):653-750, 1998. An extended abstract appeared in FOCS96.
7. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, pages 406-415, 1997.
8. M. Kearns and D. Ron. Testing problems with sub-learning sample complexity. In Proceedings of the Eleventh Annual ACM Conference on Computational Learning Theory, pages 268-279, 1998.
9. C. L. Li, S. T. McCormick, and D. Simchi-Levi. On the minimum cardinality bounded diameter and the bounded cardinality minimum diameter edge addition problems. Operations Research Letters, 11(5):303-308, 1992.
10. N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13:441-454, 1993.
11. M. Parnas and D. Ron. Testing the diameter of graphs. Available from http://www.eng.tau.ac.il/~danar, 1999.
12. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.