{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:09Z","timestamp":1725701649907},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_52","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"599-610","source":"Crossref","is-referenced-by-count":2,"title":["Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness"],"prefix":"10.1007","author":[{"given":"Frank","family":"Hellweg","sequence":"first","affiliation":[]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"52_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 in large graphs. Random Struct. Algorithms\u00a021(3-4), 359\u2013370 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"52_CR2","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"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Testing subgraphs in directed graphs. In: Proc. of the 35th ACM Symp. on the Theory of Computing (STOC), pp. 700\u2013709 (2003)","DOI":"10.1145\/780542.780644"},{"issue":"2","key":"52_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1002\/rsa.10023","volume":"20","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Ron, D.: Testing properties of directed graphs: acyclicity and connectivity. Random Structures & Algorithms\u00a020(2), 184\u2013205 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proc. of the 40th ACM Symp. on the Theory of Computing (STOC), pp. 393\u2013402 (2008)","DOI":"10.1145\/1374376.1374433"},{"issue":"6","key":"52_CR6","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":"6","key":"52_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 non-expanding bounded-degree graphs. SIAM Journal on Computing\u00a038(6), 2499\u20132510 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"52_CR8","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. J. of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"J. of the ACM"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. In: Proc. of the 29th ACM Symp. on the Theory of Computing (STOC), pp. 406\u2013415 (1997)","DOI":"10.1145\/258533.258627"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J.A., Nguyen, H.N., Onak, K.: Local graph partitions for approximation and testing. In: Proc. of the 50th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 22\u201331 (2009)","DOI":"10.1109\/FOCS.2009.77"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Newman, I., Sohler, C.: Every property of hyper nite graphs is testable. In: Proc. of the 43rd ACM Symp. on the Theory of Computing (STOC), pp. 675\u2013684 (2011)","DOI":"10.1145\/1993636.1993726"},{"issue":"2","key":"52_CR12","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"},{"issue":"1","key":"52_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11424-010-9280-5","volume":"23","author":"Y. Yoshida","year":"2010","unstructured":"Yoshida, Y., Ito, H.: Testing k-edge-connectivity of digraphs. Journal of System Science and Complexity\u00a023(1), 91\u2013101 (2010)","journal-title":"Journal of System Science and Complexity"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:01Z","timestamp":1620129301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}