On testing expansion in bounded-degree graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6650 LNCS, Issue , 2011, Pages 68-75

  Goldreich, Oded ^a   Ron, Dana ^a  

^a NONE

Author keywords

Graph Expansion; Property Testing

Indexed keywords

EIGEN-VALUE; EIGENVALUE BOUNDS; GRAPH EXPANSIONS; GRAPH MODEL; N-VERTEX GRAPH; ORACLE ACCESS; PROPERTY-TESTING;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; EXPANSION;

GRAPH THEORY;

EID: 84857590925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22670-0_9     Document Type: Article

References (9)

1. Alon, N.: Eigenvalues and expanders. Combinatorica 6, 83-96 (1986)
2. 1, Isoperimetric Inequalities for Graphs and Superconcentrators. J. Combinatorial Theory, Ser. B 38, 73-88 (1985)
3. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Inc., Chichester (2000)
4. Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that Distributions are Close. In: 41st FOCS, pp. 259-269 (2000)
5. Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. In: Proc. of the 29th ACM Symp. on Theory of Computing, pp. 406-415 (1997)
6. Goldreich, O., Ron, D.: A sublinear Bipartite Tester for Bounded Degree Graphs. Combinatorica 19(2), 1-39 (1999)
7. Goldreich, O., Sudan, M.: Computational Indistinguishability: A Sample Hierarchy. JCSS 59, 253-269 (1999)
8. Kale, S., Seshadhri, C.: Testing expansion in bounded degree graphs. In: 35th ICALP, pp. 527-538 (2008); Preliminary version appeared as TR07-076, ECCC (2007)
9. Parnas, M., Ron, D.: Testing the diameter of graphs. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 85-96. Springer, Heidelberg (1999)