Local Graph Exploration and Fast Property Testing

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.

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

[2]  Krzysztof Onak,et al.  Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.

[4]  Ronitt Rubinfeld,et al.  Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..

[5]  David Cohen-Steiner,et al.  Inferring Local Homology from Sampled Stratified Spaces , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[6]  S. D. Chatterji.  Proceedings of the International Congress of Mathematicians , 1995 .

[7]  Oded Goldreich,et al.  Introduction to Testing Graph Properties , 2010, Property Testing.

[8]  Alan M. Frieze,et al.  The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[10]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Artur Czumaj,et al.  Sublinear‐time approximation algorithms for clustering via random sampling , 2007, Random Struct. Algorithms.

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

[13]  Ronitt Rubinfeld,et al.  Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time , 2005, SIAM J. Comput..

[14]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[15]  Artur Czumaj,et al.  Estimating the weight of metric minimum spanning trees in sublinear-time , 2004, STOC '04.

[16]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[17]  Seshadhri Comandur,et al.  Testing Expansion in Bounded Degree Graphs , 2007, Electron. Colloquium Comput. Complex..

[18]  Seshadhri Comandur,et al.  An Expansion Tester for Bounded Degree Graphs , 2011, SIAM J. Comput..

[19]  Asaf Shapira,et al.  Testing the expansion of a graph , 2010, Inf. Comput..

[20]  Dana Ron,et al.  Property Testing , 2000 .

[21]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[22]  Artur Czumaj,et al.  Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..

[23]  Oded Schramm,et al.  Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..

[24]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[25]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.

[26]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.