{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:17Z","timestamp":1759637897134,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_7","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T15:25:55Z","timestamp":1286465155000},"page":"105-141","source":"Crossref","is-referenced-by-count":15,"title":["Introduction to Testing Graph Properties"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.10056","volume":"21","author":"N. Alon","year":"2002","unstructured":"Alon, N.: Testing subgraphs of large graphs. Random Structures and Algorithms\u00a021, 359\u2013370 (2002)","journal-title":"Random Structures and Algorithms"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient Testing of Large Graphs. Combinatorica\u00a020, 451\u2013476 (2000)","journal-title":"Combinatorica"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It\u2019s All About Regularity. In: 38th STOC, pp. 251\u2013260 (2006)","DOI":"10.1145\/1132516.1132555"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/S0895480199358655","volume":"15","author":"N. Alon","year":"2002","unstructured":"Alon, N., Krivelevich, M.: Testing k-Colorability. SIAM Journal on Disc.\u00a0Math.\u00a015(2), 211\u2013227 (2002)","journal-title":"SIAM Journal on Disc.\u00a0Math."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle freeness in general graphs. In: 17th SODA, pp. 279\u2013288 (2006)","DOI":"10.1145\/1109557.1109589"},{"key":"7_CR6","first-page":"354","volume":"69","author":"N. Alon","year":"2004","unstructured":"Alon, N., Shapira, A.: Testing subgraphs in directed graphs. JCSS\u00a069, 354\u2013482 (2004)","journal-title":"JCSS"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Every Monotone Graph Property is Testable. In: 37th STOC, pp. 128\u2013137 (2005)","DOI":"10.1145\/1060590.1060611"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: A Characterization of the (natural) Graph Properties Testable with One-Sided. In: 46th FOCS, pp. 429\u2013438 (2005)","DOI":"10.1109\/SFCS.2005.5"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1017\/S0963548306007759","volume":"15","author":"N. Alon","year":"2006","unstructured":"Alon, N., Shapira, A.: A Characterization of Easily Testable Induced Subgraphs. Combinatorics Probability and Computing\u00a015, 791\u2013805 (2006)","journal-title":"Combinatorics Probability and Computing"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00493-008-2321-1","volume":"28","author":"N. Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: A Separation Theorem in Property Testing. Combinatorica\u00a028(3), 261\u2013281 (2008)","journal-title":"Combinatorica"},{"key":"7_CR11","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, Inc., Chichester (1992)"},{"issue":"1","key":"7_CR12","first-page":"193","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. JCSS\u00a058(1), 193\u2013210 (1999)","journal-title":"JCSS"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that Distributions are Close. In: 41st FOCS, pp. 259\u2013269 (2000)","DOI":"10.1109\/SFCS.2000.892113"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Bellare, M., Coppersmith, D., H\u00e5stad, J., Kiwi, M., Sudan, M.: Linearity testing in characteristic two. In: The 36th FOCS, pp. 432\u2013441 (1995)","DOI":"10.1109\/SFCS.1995.492574"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free Bits, PCPs and Non-approximability \u2013 Towards Tight Results. SIAM Journal on Computing\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Bender, M., Ron, D.: Testing acyclicity of directed graphs in sublinear time. Random Structures and Algorithms, 184\u2013205 (2002)","DOI":"10.1002\/rsa.10023.abs"},{"key":"7_CR17","unstructured":"Ben-Eliezer, I., Kaufman, T., Krivelevich, M., Ron, D.: Comparing the strength of query types in property testing: the case of testing k-colorability. In: 19th SODA (2008)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Benjamini, I., Schramm, O., Shapira, A.: Every Minor-Closed Property of Sparse Graphs is Testable. In: 40th STOC, pp. 393\u2013402 (2008)","DOI":"10.1145\/1374376.1374433"},{"issue":"3","key":"7_CR19","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-Testing\/Correcting with Applications to Numerical Problems. JCSS\u00a047(3), 549\u2013595 (1993)","journal-title":"JCSS"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Obata, K., Trevisan, L.: A lower bound for testing 3-colorability in bounded-degree graphs. In: 43rd FOCS, pp. 93\u2013102 (2002)","DOI":"10.1109\/SFCS.2002.1181886"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: Lower Bounds for Testing Bipartiteness in Dense Graphs. In: IEEE Conference on Computational Complexity, pp. 75\u201381 (2004)","DOI":"10.1109\/CCC.2004.1313803"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R., Even, G., Goldreich, O.: Lower Bounds for Sampling Algorithms for Estimating the Average. In: IPL, vol.\u00a053, pp. 17\u201325 (1995)","DOI":"10.1016\/0020-0190(94)00171-T"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48224-5_16","volume-title":"Automata, Languages and Programming","author":"B. Chazelle","year":"2001","unstructured":"Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<187::AID-RSA3>3.0.CO;2-U","volume":"8","author":"W.F. Vega de la","year":"1996","unstructured":"de la Vega, W.F.: MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms\u00a08(3), 187\u2013198 (1996)","journal-title":"Random Structures and Algorithms"},{"key":"7_CR25","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, Rockville (1979)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S. Even","year":"1984","unstructured":"Even, S., Selman, A.L., Yacobi, Y.: The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inform. and Control\u00a061, 159\u2013173 (1984)","journal-title":"Inform. and Control"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Fischer, E., Matsliah, A.: Testing graph isomorphism. In: 17th SODA, pp. 299\u2013308 (2006)","DOI":"10.1145\/1109557.1109591"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Fischer, E., Matsliah, A., Shapira, A.: Approximate hypergraph partitioning and applications. In: Proceedings of 48th FOCS, pp. 579\u2013589 (2007)","DOI":"10.1109\/FOCS.2007.12"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Fischer, E., Newman, I.: Testing versus estimation of graph properties. In: 37th STOC, pp. 138\u2013146 (2005)","DOI":"10.1145\/1060590.1060612"},{"key":"#cr-split#-7_CR30.1","unstructured":"Goldreich, O.: On Promise Problems. In: memory of Shimon Even (1935???2004). ECCC, TR05-018 (January 2005);"},{"key":"#cr-split#-7_CR30.2","unstructured":"See also in Theoretical Computer Science: Essays in Memory of Shimon Even, Springer, LNCS Festschrift, Vol.??3895 (March 2006)"},{"key":"7_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptual Perspective","author":"O. Goldreich","year":"2008","unstructured":"Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)"},{"key":"#cr-split#-7_CR32.1","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM, 653???750 (July 1998);","DOI":"10.1145\/285055.285060"},{"key":"#cr-split#-7_CR32.2","unstructured":"Extended abstract in 37th FOCS (1996)"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-16367-8_7","volume-title":"Property Testing","author":"O. Goldreich","year":"2010","unstructured":"Goldreich, O., Krivelevich, M., Newman, I., Rozenberg, E.: Hierarchy Theorems for Property Testing. In: Goldreich, O. (ed.) Property Testing. LNCS, vol.\u00a06390, pp. 105\u2013141. Springer, Heidelberg (2010)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302\u2013343 (2002)","DOI":"10.1007\/s00453-001-0078-7"},{"issue":"3","key":"7_CR35","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s004930050060","volume":"19","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Ron, D.: A sublinear bipartite tester for bounded degree graphs. Combinatorica\u00a019(3), 335\u2013373 (1999)","journal-title":"Combinatorica"},{"key":"7_CR36","unstructured":"Goldreich, O., Ron, D.: On Testing Expansion in Bounded-Degree Graphs. ECCC, TR00-020 (March 2000)"},{"issue":"3","key":"7_CR37","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/rsa.20203","volume":"32","author":"O. Goldreich","year":"2008","unstructured":"Goldreich, O., Ron, D.: Approximating Average Parameters of Graphs. Random Structures and Algorithms\u00a032(3), 473\u2013493 (2008)","journal-title":"Random Structures and Algorithms"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-16367-8_7","volume-title":"Property Testing","author":"O. Goldreich","year":"2010","unstructured":"Goldreich, O., Ron, D.: Algorithmic Aspects of Property Testing in the Dense Graphs Model. In: Goldreich, O. (ed.) Property Testing. LNCS, vol.\u00a06390, pp. 105\u2013141. Springer, Heidelberg (2010)"},{"key":"#cr-split#-7_CR39.1","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: On Proximity Oblivious Testing. ECCC, TR08-041 (2008);","DOI":"10.1145\/1536414.1536436"},{"key":"#cr-split#-7_CR39.2","unstructured":"Also in the proceedings of the 41st STOC (2009)"},{"issue":"1","key":"7_CR40","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.10078","volume":"23","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Structures and Algorithms\u00a023(1), 23\u201357 (2003)","journal-title":"Random Structures and Algorithms"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-540-74208-1_38","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Gonen","year":"2007","unstructured":"Gonen, M., Ron, D.: On the Benefit of Adaptivity in Property Testing of Dense Graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 525\u2013539. Springer, Heidelberg (2007); To appear in Algorithmica (special issue of RANDOM and APPROX 2007)"},{"key":"7_CR42","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999) (Preliminary Version in 28th STOC, 1996 and 37th FOCS, 1996)","journal-title":"Acta Mathematica"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J., Nguyen, H., Onak, K.: Local Graph Partitions for Approximation and Testing. In: 50th FOCS, pp. 22\u201331 (2009)","DOI":"10.1109\/FOCS.2009.77"},{"key":"7_CR44","unstructured":"Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard Problems. PWS (1996)"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-70575-8_43","volume-title":"Automata, Languages and Programming","author":"S. Kale","year":"2008","unstructured":"Kale, S., Seshadhri, C.: Testing expansion in bounded degree graphs. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 527\u2013538. Springer, Heidelberg (2008); Preliminary version appeared as TR07-076, ECCC (2007)"},{"issue":"6","key":"7_CR46","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1137\/S0097539703436424","volume":"33","author":"T. Kaufman","year":"2004","unstructured":"Kaufman, T., Krivelevich, M., Ron, D.: Tight Bounds for Testing Bipartiteness in General Graphs. SIAM Journal on Computing\u00a033(6), 1441\u20131483 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR47","unstructured":"Lov\u00e1sz, L., Young, N.: Lecture notes on evasiveness of graph properties. Technical Report TR\u2013317\u201391, Princeton University, Computer Science Department (1991)"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Marko, S., Ron, D.: Distance approximation in bounded-degree and general sparse graphs. Transactions on Algorithms\u00a05(2), Article no. 22 (2009)","DOI":"10.1145\/1497290.1497298"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Mihail, M.: Conductance and convergence of Markov chains\u2013 A combinatorial treatment of expanders. In: 30th FOCS, pp. 526\u2013531 (1989)","DOI":"10.1109\/SFCS.1989.63529"},{"key":"7_CR50","unstructured":"Nachmias, A., Shapira, A.: Testing the expansion of a graph. TR07-118, ECCC (2007)"},{"key":"7_CR51","unstructured":"Orenstein, Y.: Testing properties of directed graphs. Master\u2019s thesis, School of Electrical Engineering (2010)"},{"issue":"2","key":"7_CR52","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/rsa.10013","volume":"20","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D.: Testing the diameter of graphs. Random Structures and Algorithms\u00a020(2), 165\u2013183 (2002)","journal-title":"Random Structures and Algorithms"},{"issue":"6","key":"7_CR53","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.jcss.2006.03.002","volume":"72","author":"M. Parnas","year":"2006","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant Property Testing and Distance Approximation. Journal of Computer and System Sciences\u00a072(6), 1012\u20131042 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR54","unstructured":"Raskhodnikova, S., Smith, A.: A note on adaptivity in testing properties of bounded-degree graphs. ECCC, TR06-089 (2006)"},{"issue":"2","key":"7_CR55","first-page":"73","volume":"5","author":"D. Ron","year":"2010","unstructured":"Ron, D.: Algorithmic and Analysis Techniques in Property Testing. Foundations and Trends in TCS\u00a05(2), 73\u2013205 (2010)","journal-title":"Foundations and Trends in TCS"},{"issue":"2","key":"7_CR56","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR57","unstructured":"E. Szemeredi. Regular partitions of graphs. In: Proceedings, Collogue Inter. CNRS, pp. 399\u2013401 (1978)"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T13:18:33Z","timestamp":1740575913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}