Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Randomization and Approximation Techniques in Computer Science

International Workshop on Approximation Algorithms for Combinatorial Optimization

RANDOM 1999, APPROX 1999: Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques pp 85–96Cite as

Testing the Diameter of Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1671))

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

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, Inc., Chichester (1992)

    MATH  Google Scholar 

  4. Awerbuch, B.: Complexity of network synchronization. Journal of the Association for Computing Machinery 32, 804–823 (1985)

    MATH  MathSciNet  Google Scholar 

  5. Dyer, M.E., Frieze, A.M.: A simple heuristic for the p-centre problem. Operations Research Letters 3(6), 285–288 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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 1996

    MATH  MathSciNet  Google Scholar 

  7. 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. 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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Linial, N., Saks, M.: Low diameter graph decompositions. Combinatorica 13, 441–454 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Parnas, M., Ron, D.: Testing the diameter of graphs (1999), Available from http://www.eng.tau.ac.il/~danar

  12. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Academic College of Tel-Aviv-Yaffo, Tel-Aviv, Israel

    Michal Parnas

  2. Department of EE – Systems, Tel-Aviv University, Ramat Aviv, Israel

    Dana Ron

Authors
  1. Michal Parnas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dana Ron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley

    Dorit S. Hochbaum

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Centre Universitaire d’Informatique, Battelle Bâtiment A, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. Computer Science Division, University of California, 94720, Berkeley, CA

    Alistair Sinclair

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parnas, M., Ron, D. (1999). Testing the Diameter of Graphs. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48413-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66329-4

  • Online ISBN: 978-3-540-48413-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation