Testing the diameter of graphs

[1]  Dana Ron,et al.  Testing Problems with Sublearning Sample Complexity , 2000, J. Comput. Syst. Sci..

[2]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000, J. Graph Theory.

[3]  Dana Ron,et al.  Testing problems with sub-learning sample complexity , 1998, COLT' 98.

[4]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[5]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[6]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[7]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[8]  Chung-Lun Li,et al.  On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems , 1992, Oper. Res. Lett..

[9]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[10]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[11]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[12]  A. Frieze,et al.  A simple heuristic for the p-centre problem , 1985 .