{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:30:30Z","timestamp":1648996230831},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00453-013-9842-8","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T16:05:28Z","timestamp":1383581128000},"page":"1065-1075","source":"Crossref","is-referenced-by-count":1,"title":["Testing the Supermodular-Cut Condition"],"prefix":"10.1007","volume":"71","author":[{"given":"Shin-Ichi","family":"Tanigawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"issue":"3","key":"9842_CR1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A. Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A., Frank, A.: Covering symmetric supermodular functions by graphs. Math. Program. 84(3), 483\u2013503 (1999)","journal-title":"Math. Program."},{"key":"9842_CR2","first-page":"91","volume":"9","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J.: Edge-disjoint branchings. Comb. Algorithms 9, 91\u201396 (1973)","journal-title":"Comb. Algorithms"},{"key":"9842_CR3","first-page":"34","volume-title":"Mathematical Programming: State of the Art","author":"A. Frank","year":"1994","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Birge, J., Murty, K. (eds.) Mathematical Programming: State of the Art, vol. 1994, pp. 34\u201363. The University of Michigan Press, Michigan (1994)"},{"key":"9842_CR4","series-title":"Oxford Lecture Series in Mathematics and Its Applications.","volume-title":"Connections in Combinatorial Optimization","author":"A. Frank","year":"2011","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2011)"},{"key":"9842_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-540-76796-1_6","volume-title":"Research Trends in Combinatorial Optimization","author":"A. Frank","year":"2009","unstructured":"Frank, A., Kir\u00e1ly, T.: A survey on covering supermodular functions. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 87\u2013126. Springer, Berlin (2009)"},{"issue":"2","key":"9842_CR6","doi-asserted-by":"crossref","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 32(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"9842_CR7","doi-asserted-by":"crossref","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. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"9842_CR8","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/978-3-642-31594-7_42","volume-title":"Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP)","author":"H. Ito","year":"2012","unstructured":"Ito, H., Tanigawa, S., Yoshida, Y.: Constant-time algorithms for sparsity matroids. In: Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP), pp. 498\u2013509 (2012)"},{"issue":"6","key":"9842_CR9","doi-asserted-by":"crossref","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 J. Comput. 33(6), 1441\u20131483 (2004)","journal-title":"SIAM J. Comput."},{"key":"9842_CR10","unstructured":"Orenstein, Y.: Property testing in directed graphs. Master\u2019s thesis, Tel-Aviv University (2010)"},{"issue":"2","key":"9842_CR11","doi-asserted-by":"crossref","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 Struct. Algorithms 20(2), 165\u2013183 (2002)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"9842_CR12","doi-asserted-by":"crossref","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. J. Syst. Sci. Complex. 23(1), 91\u2013101 (2010)","journal-title":"J. Syst. Sci. Complex."},{"issue":"3","key":"9842_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s00453-010-9477-y","volume":"62","author":"Y. Yoshida","year":"2012","unstructured":"Yoshida, Y., Ito, H.: Property testing on k-vertex-connectivity of graphs. Algorithmica 62(3), 701\u2013712 (2012)","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9842-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9842-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9842-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:13Z","timestamp":1559137513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9842-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9842"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9842-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,5]]}}}