{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T02:24:58Z","timestamp":1673231098544},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s11424-010-9280-5","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T07:42:45Z","timestamp":1266997365000},"page":"91-101","source":"Crossref","is-referenced-by-count":11,"title":["Testing k-edge-connectivity of digraphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Yuichi","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"issue":"4","key":"9280_CR1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, JACM, 1998, 45(4): 653\u2013750.","journal-title":"JACM"},{"issue":"2","key":"9280_CR2","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O. Goldreich","year":"2002","unstructured":"O. Goldreich, D. Ron, Property testing in bounded degree graphs, Algorithmica, 2002, 32(2): 302\u2013343.","journal-title":"Algorithmica"},{"key":"9280_CR3","doi-asserted-by":"crossref","unstructured":"Y. Yoshida and H. Ito, Property testing on k-vertex-connectivity of graphs, in ICALP\u201908: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, LNCS, Springer, 2008, to appear.","DOI":"10.1007\/978-3-540-70575-8_44"},{"key":"9280_CR4","doi-asserted-by":"crossref","unstructured":"I. Benjamini, O. Schramm, and A. Shapira, Every minor-closed property of sparse graphs is testable, in STOC\u201908: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008.","DOI":"10.1145\/1374376.1374433"},{"key":"9280_CR5","doi-asserted-by":"crossref","unstructured":"O. Goldreich, and D. Ron, A sublinear bipartiteness tester for bounded degree graphs, in STOC\u2019 98: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, 289\u2013298.","DOI":"10.1145\/276698.276767"},{"key":"9280_CR6","unstructured":"O. Goldreich, and D. Ron, On testing expansion in bounded-degree graphs, Electronic Colloquium on Computational Complexity (ECCC), 2000, 020."},{"key":"9280_CR7","doi-asserted-by":"crossref","unstructured":"A. Czumaj and C. Sohler, Testing expansion in bounded-degree graphs, in: FOCS\u201907: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, 570\u2013578.","DOI":"10.1109\/FOCS.2007.33"},{"issue":"2","key":"9280_CR8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1002\/rsa.10023","volume":"20","author":"M. A. Bender","year":"2002","unstructured":"M. A. Bender and D. Ron, Testing properties of directed graphs: Acyclicity and connectivity, Random Struct. Algorithms, 2002, 20(2): 184\u2013205.","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"9280_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discret. Math., 1992, 5(1): 25\u201353.","journal-title":"SIAM J. Discret. Math."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-9280-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-010-9280-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-9280-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:01Z","timestamp":1559400841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-010-9280-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9280"],"URL":"https:\/\/doi.org\/10.1007\/s11424-010-9280-5","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2]]}}}