Advertisement

Abstract

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 ε-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/ε.

Keywords

Boundary Function Testing Algorithm Distance Parameter Graph Property Operation Research Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Michal Parnas
    • 1
  • Dana Ron
    • 2
  1. 1.The Academic College of Tel-Aviv-YaffoTel-AvivIsrael
  2. 2.Department of EE – SystemsTel-Aviv UniversityRamat AvivIsrael

Personalised recommendations