{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:01Z","timestamp":1725563701938},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_35","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"410-414","source":"Crossref","is-referenced-by-count":0,"title":["Local Graph Exploration and Fast Property Testing"],"prefix":"10.1007","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/060667177","volume":"39","author":"N. Alon","year":"2009","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it\u2019s all about regularity. SIAM Journal on Computing\u00a039(1), 143\u2013167 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/06064888X","volume":"37","author":"N. Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. SIAM Journal on Computing\u00a037(6), 1703\u20131727 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013402 (2008)","DOI":"10.1145\/1374376.1374433"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. Journal of Computer and System Sciences\u00a047(3), 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1137\/S0097539702403244","volume":"34","author":"B. Chazelle","year":"2005","unstructured":"Chazelle, B., Rubinfeld, R., Trevisan, L.: Approximating the minimum spanning tree weight in sublinear time. SIAM Journal on Computing\u00a034(6), 1370\u20131379 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S0097539703435297","volume":"35","author":"A. Czumaj","year":"2005","unstructured":"Czumaj, A., Erg\u00fcn, 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\u00a035(1), 91\u2013109 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1137\/070681831","volume":"38","author":"A. Czumaj","year":"2009","unstructured":"Czumaj, A., Shapira, A., Sohler, C.: Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing\u00a038, 2499\u20132510 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR8","first-page":"23","volume":"89","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time algorithms. Bulletin of the EATCS\u00a089, 23\u201347 (2006)","journal-title":"Bulletin of the EATCS"},{"issue":"1-2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/rsa.20157","volume":"30","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time approximation algorithms for clustering via random sampling. Random Structures and Algorithms\u00a030(1-2), 226\u2013256 (2007)","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/060672121","volume":"39","author":"A. Czumaj","year":"2009","unstructured":"Czumaj, A., Sohler, C.: Estimating the weight of metric minimum spanning trees in sublinear-time. SIAM Journal on Computing\u00a039(3), 904\u2013922 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013578 (2007)","DOI":"10.1109\/FOCS.2007.33"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"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\u201320 (1996)","DOI":"10.1109\/SFCS.1996.548459"},{"key":"35_CR13","unstructured":"Goldreich, O.: Introduction to testing graph properties. Electronic Colloquium on Computational Complexity (ECCC), Report No. 082 (2010)"},{"issue":"4","key":"35_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica\u00a032(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR16","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 bipartiteness tester for bounded degree graphs. Combinatorica\u00a019(3), 335\u2013373 (1999)","journal-title":"Combinatorica"},{"key":"35_CR17","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC), Report No. 7 (2000)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"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\u201331 (2009)","DOI":"10.1109\/FOCS.2009.77"},{"key":"35_CR19","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.: An expansion tester for 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)"},{"issue":"6","key":"35_CR20","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"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ic.2009.09.002","volume":"208","author":"A. Nachmias","year":"2010","unstructured":"Nachmias, A., Shapira, A.: Testing the expansion of a graph. Information and Computation\u00a0208(4), 309\u2013314 (2010)","journal-title":"Information and Computation"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013336 (2008)","DOI":"10.1109\/FOCS.2008.81"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Ron, D.: Property testing. In: Handobook of Randomized Algorithms, vol.\u00a0II, pp. 597\u2013649 (2001)","DOI":"10.1007\/978-1-4615-0013-1_15"},{"key":"35_CR24","unstructured":"Rubinfeld, R.: Sublinear time algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)"},{"issue":"2","key":"35_CR25","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T20:30:38Z","timestamp":1553027438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}