{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:08:02Z","timestamp":1754262482765},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_63","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"763-774","source":"Crossref","is-referenced-by-count":8,"title":["Testing Forest-Isomorphism in the Adjacency List Model"],"prefix":"10.1007","author":[{"given":"Mitsuru","family":"Kusumoto","sequence":"first","affiliation":[]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"63_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":"2","key":"63_CR2","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1137\/07067917X","volume":"22","author":"N. Alon","year":"2008","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle-freeness in general graphs. SIAM Journal on Discrete Mathematics\u00a022(2), 786\u2013819 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"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: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1213\u20131222 (2008)","key":"63_CR3"},{"issue":"1","key":"63_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/070680795","volume":"38","author":"E. Fischer","year":"2008","unstructured":"Fischer, E., Matsliah, A.: Testing graph isomorphism. SIAM Journal on Computing\u00a038(1), 207\u2013225 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"63_CR5","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.: Introduction to testing graph properties. In: Goldreich, O. (ed.) Property Testing. LNCS, vol.\u00a06390, pp. 105\u2013141. Springer, Heidelberg (2010)"},{"issue":"4","key":"63_CR6","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":"63_CR7","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"},{"doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: FOCS 2009: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 22\u201331 (2009)","key":"63_CR8","DOI":"10.1109\/FOCS.2009.77"},{"issue":"6","key":"63_CR9","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":"3","key":"63_CR10","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/120890946","volume":"42","author":"I. Newman","year":"2013","unstructured":"Newman, I., Sohler, C.: Every property of hyperfinite graphs is testable. SIAM Journal on Computing\u00a042(3), 1095\u20131112 (2013)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"63_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Tanigawa, S., Yoshida, Y.: Testing the supermodular-cut condition. Algorithmica, 1\u201311 (2013)","key":"63_CR12","DOI":"10.1007\/s00453-013-9842-8"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:26:21Z","timestamp":1558909581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}