Testing expansion in bounded-degree graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 570-578

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; PROBABILITY;

BOUNDED DEGREE GRAPHS; DEGREE GRAPHS; GRAPH G; PROPERTY TESTING;

GRAPH THEORY;

EID: 46749157525     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389526     Document Type: Conference Paper

References (25)

1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2): 83-96, 1986.
2. N. Alon, E. Fischer, I. Newman, and A. Shapira. A combinatorial characterization of the testable graph properties: it's all about regularity. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 251-260, 2006.
3. 1, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1): 73-88, 1985.
4. N. Alon and A. Shapira. A characterization of the (natural) graph properties testable with one-sided error. Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 429-438, 2005.
5. T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, and P. White. Testing that distributions are close. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 259-269, 2000.
6. M. A. Bender and D. Ron. Testing properties of directed graphs: acyclicity and connectivity. Random Structures and Algorithms, 20(2): 184-205, 2002.
7. A. Bogdanov, K. Obata, and L. Trevisan. A lower bound for testing 3-colorability in bounded-degree graphs. Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 93-102, 2002.
8. C. Borgs, J. Chayes, L. Lovász, V. T. Sos, B. Szegedy, and K. Vesztergombi. Graph limits and parameter testing. Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 261-270, 2006.
9. A. Czumaj and C. Sohler. Abstract combinatorial programs and efficient property testers. SIAM Journal on Computing, 34(3): 580-615, 2005.
10. A. Czumaj and C. Sohler. Sublinear-time algorithms. Bulletin of the EATCS, 89: 23-47, June 2006.
11. A. Czumaj, A. Shapira, and C. Sohlen Testing hereditary properties of non-expanding boundeddegree graphs. Submitted, 2007. This is a full version of [12].
12. A. Czumaj and C. Sohlen On testable properties in bounded degree graphs. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 494-501, 2007. Full version appeared in [11].
13. E. Fischer. The art of uninformed decisions: A primer to property testing. Bulletin of the EATCS, 75: 97-126, October 2001.
14. O. Goldreich. Combinatorial property testing (a survey). In P. Pardalos, S. Rajasekaran, and J. Rolim, editors, Proceedings of the DIMACS Workshop on Randomization Methods in Algorithm Design, volume 43 of DIMACS, Series in Discrete Mathetaics and Theoretical Computer Science, pp. 45-59, 1997. American Mathematical Society, Providence, RI, 1999.
15. O. Goldreich. Property testing in massive graphs. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of massive data sets, pp. 123-147. Kluwer Academic Publishers, 2002.
16. O. Goldreich and D. Ron. A sublinear bipartiteness tester for bounded degree graphs. Combinatorica, 19(3):335-373, 1999.
17. O. Goldreich and D. Ron. On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC), Report No. 7, 2000.
18. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2): 302-343, 2002.
19. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4): 439-561, October 2006.
20. R. Kumar and R. Rubinfeld. Sublinear time algorithms. SIGACT News, 34: 57-67, 2003.
21. M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: An approach to approximate counting and integration. Chapter 12 in Approximation Algorithms for NP-hard Problems, edited by D. Hochbaum, PWS Publishing, Boston, 1996.
22. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2): 165-183, 2002.
23. D. Ron. Property testing. In P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, editors, Handobook of Randomized Algorithms, volume II, pp. 597-649. Kluwer Academic Publishers, 2001.
24. A. Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing, 1: 351-370, 1992.
25. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82(1): 93-133, July 1989.