Testing the Diameter of Graphs

Random Structures and Algorithms

Volumn 20, Issue 2, 2002, Pages 165-183

  Parnas, Michal ^a   Ron, Dana ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Graph algorithms; Property testing

Indexed keywords

EID: 0036114977     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10013     Document Type: Article

References (11)

1. N. Alon, A. Gyárfás, and M. Ruszinkó, Decreasing the diameter of bounded degree graphs, Graph Theory (1999), to appear in Journal of Graph Theory.
2. B. Awerbuch and D. Peleg, Sparse Partitions, Proc 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 503-513.
3. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
4. B. Awerbuch, Complexity of network synchronization, J Assoc Comput Mach 32 (1985), 804-823.
5. M.E. Dyer and A.M. Frieze, A simple heuristic for the p-centre problem, Oper Res Lett 3(6) (1985), 285-288.
6. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J Assoc Comput Mach 45(4) (1988), 653-750.
7. O. Goldreich and D. Ron, Property Testing in Bounded Degree Graphs, Proc Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415. To appear in Algorithmica.
8. M. Kearns and D. Ron, Testing problems with Sub-learning Sample Complexity, J Computer and Science Systems 61(3) (2000), 428-456.
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, Oper Res Lett 11(5) (1992), 303-308.
10. N. Linial and M. Saks, Low diameter graph decompositions, Combinatorica 13 (1993), 441-454.
11. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25(2) (1996), 252-271.