论文信息 - Testing the diameter of graphs

Testing the diameter of graphs

We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of [GR97]. In this model we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is e-far from any graph with diameter at most β (D). The function β (D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/e.

Dana Ron | Michal Parnas | D. Ron | Michal Parnas

[1] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.

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

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

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

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

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

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

[8] Noga Alon,et al. Decreasing the diameter of bounded degree graphs , 2000 .

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

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

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