{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:21Z","timestamp":1764557241759},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"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":[[2012,4]]},"DOI":"10.1007\/s00453-010-9477-y","type":"journal-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T15:45:47Z","timestamp":1291131947000},"page":"701-712","source":"Crossref","is-referenced-by-count":11,"title":["Property Testing on k-Vertex-Connectivity of\u00a0Graphs"],"prefix":"10.1007","volume":"62","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,12,1]]},"reference":[{"issue":"3","key":"9477_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0403027","volume":"3","author":"D. Bienstock","year":"1990","unstructured":"Bienstock, D., Brickell, E.F., Monma, C.L.: On the structure of minimum-weight k-connected spanning networks. SIAM J. Discrete Math. 3(3), 320\u2013329 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9477_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollobas","year":"2004","unstructured":"Bollobas, B.: Extremal Graph Theory. Dover, New York (2004)"},{"issue":"3","key":"9477_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00453-001-0017-7","volume":"30","author":"J. Cheriyan","year":"2001","unstructured":"Cheriyan, J., Jord\u00e1n, T., Nutov, Z.: On rooted node-connectivity problems. Algorithmica 30(3), 353\u2013375 (2001)","journal-title":"Algorithmica"},{"key":"9477_CR4","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/FOCS.2007.33","volume-title":"FOCS \u201907: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. In: FOCS \u201907: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 570\u2013578 (2007)"},{"key":"9477_CR5","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. BEATCS: Bull. Eur. Assoc. Theor. Comput. Sci. 75 (2001)"},{"key":"9477_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorial property testing (a survey) (1998)","DOI":"10.1090\/dimacs\/043\/04"},{"key":"9477_CR7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/258533.258627","volume-title":"STOC \u201997: Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: STOC \u201997: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 406\u2013415. ACM, New York (1997)"},{"key":"9477_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/276698.276767","volume-title":"STOC \u201998: Proceedings of the 30th Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. In: STOC \u201998: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 289\u2013298. ACM, New York (1998)"},{"key":"9477_CR9","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC) (020) (2000)"},{"issue":"4","key":"9477_CR10","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":"9477_CR11","series-title":"LNCS","first-page":"312","volume-title":"ISAAC \u201900: Proceedings of the 11th International Conference on Algorithms and Computation","author":"B. Jackson","year":"2000","unstructured":"Jackson, B., Jord\u00e1n, T.: A near optimal algorithm for vertex connectivity augmentation. In: ISAAC \u201900: Proceedings of the 11th International Conference on Algorithms and Computation. LNCS, vol. 1969, pp. 312\u2013325. Springer, Berlin (2000)"},{"issue":"1","key":"9477_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B. Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory Ser. B 94(1), 31\u201377 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"9477_CR13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T. Jord\u00e1n","year":"1995","unstructured":"Jord\u00e1n, T.: On the optimal vertex-connectivity augmentation. J. Comb. Theory Ser. B 63(1), 8\u201320 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"9477_CR14","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1006\/jctb.1997.1786","volume":"71","author":"T. Jord\u00e1n","year":"1997","unstructured":"Jord\u00e1n, T.: A note on the vertex-connectivity augmentation problem. J. Comb. Theory Ser. B 71(2), 294\u2013301 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"9477_CR15","doi-asserted-by":"crossref","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 J. Comput. 25(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9477_CR16","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."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9477-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9477-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9477-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T17:40:39Z","timestamp":1559842839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9477-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,1]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9477"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9477-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,1]]}}}