Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2010: Algorithms – ESA 2010 pp 410–414Cite as

Local Graph Exploration and Fast Property Testing

  • Conference paper

  • 1657 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6346))

Abstract

We will present some recent results about testing graph properties in sparse graphs and will discuss graph exploration techniques which allow very efficient algorithms for testing graph properties.

Research supported by EPSRC award EP/G064679/1 and by the Centre for Discrete Mathematics and its Applications (DIMAP), EPSRC award EP/D063191/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., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM Journal on Computing 39(1), 143–167 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. SIAM Journal on Computing 37(6), 1703–1727 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 393–402 (2008)

    Google Scholar 

  4. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47(3), 549–595 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SIAM Journal on Computing 34(6), 1370–1379 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., Sohler, C.: Approximating the weight of the Euclidean minimum spanning tree in sublinear time. SIAM Journal on Computing 35(1), 91–109 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Czumaj, A., Shapira, A., Sohler, C.: Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing 38, 2499–2510 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Czumaj, A., Sohler, C.: Sublinear-time algorithms. Bulletin of the EATCS 89, 23–47 (2006)

    MATH  MathSciNet  Google Scholar 

  9. Czumaj, A., Sohler, C.: Sublinear-time approximation algorithms for clustering via random sampling. Random Structures and Algorithms 30(1-2), 226–256 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. Czumaj, A., Sohler, C.: Estimating the weight of metric minimum spanning trees in sublinear-time. SIAM Journal on Computing 39(3), 904–922 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. In: Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 570–578 (2007)

    Google Scholar 

  12. Frieze, A., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 12–20 (1996)

    Google Scholar 

  13. Goldreich, O.: Introduction to testing graph properties. Electronic Colloquium on Computational Complexity (ECCC), Report No. 082 (2010)

    Google Scholar 

  14. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. Combinatorica 19(3), 335–373 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC), Report No. 7 (2000)

    Google Scholar 

  18. Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: Proceedings of the 50th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 22–31 (2009)

    Google Scholar 

  19. Kale, S., Seshadhri, C.: An expansion tester for bounded degree graphs. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 527–538. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing 33(6), 1441–1483 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Nachmias, A., Shapira, A.: Testing the expansion of a graph. Information and Computation 208(4), 309–314 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nguyen, H.N., Onak, K.: Constant-time approximation algorithms via local improvements. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 327–336 (2008)

    Google Scholar 

  23. Ron, D.: Property testing. In: Handobook of Randomized Algorithms, vol. II, pp. 597–649 (2001)

    Google Scholar 

  24. Rubinfeld, R.: Sublinear time algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)

    Google Scholar 

  25. 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. Centre for Discrete Mathematics and its Applications (DIMAP) and Department of Computer Science, University of Warwick, UK

    Artur Czumaj

Authors
  1. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, TU Eindhoven, Eindhoven, The Netherlands

    Mark de Berg

  2. Institute for Computer Science, J.W. Goethe University, 60325, Frankfurt/Main, Germany

    Ulrich Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czumaj, A. (2010). Local Graph Exploration and Fast Property Testing. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15775-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15775-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15774-5

  • Online ISBN: 978-3-642-15775-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation