{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:52:32Z","timestamp":1743011552170,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_44","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"539-550","source":"Crossref","is-referenced-by-count":3,"title":["Property Testing on k-Vertex-Connectivity of Graphs"],"prefix":"10.1007","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","reference":[{"issue":"3","key":"44_CR1","doi-asserted-by":"publisher","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. Discret. Math.\u00a03(3), 320\u2013329 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"44_CR2","unstructured":"Bollobas, B.: Extremal Graph Theory. Dover Publications (2004) (incorporated)"},{"issue":"3","key":"44_CR3","doi-asserted-by":"publisher","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\u00a030(3), 353\u2013375 (2001)","journal-title":"Algorithmica"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Sohler, C.: Testing expansion in bounded-degree graphs. In: FOCS 2007: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 570\u2013578 (2007)","DOI":"10.1109\/FOCS.2007.33"},{"key":"44_CR5","unstructured":"Fischer, E.: The art of uninformed decisions: A primer to property testing. BEATCS: Bulletin of the European Association for Theoretical Computer Science\u00a075 (2001)"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Combinatorial property testing (a survey) (1998)","DOI":"10.1090\/dimacs\/043\/04"},{"key":"44_CR7","first-page":"406","volume-title":"STOC 1997: 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 1997: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 406\u2013415. ACM, New York (1997)"},{"key":"44_CR8","first-page":"289","volume-title":"STOC 1998: 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 1998: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 289\u2013298. ACM, New York (1998)"},{"key":"44_CR9","unstructured":"Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC) (020) (2000)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-40996-3_27","volume-title":"Algorithms and Computation","author":"B. Jackson","year":"2000","unstructured":"Jackson, B., Jord\u00e1n, T.: A near optimal algorithm for vertex connectivity augmentation. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 312\u2013325. Springer, Heidelberg (2000)"},{"issue":"1","key":"44_CR11","doi-asserted-by":"publisher","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\u00a094(1), 31\u201377 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"44_CR12","doi-asserted-by":"publisher","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\u00a063(1), 8\u201320 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"44_CR13","doi-asserted-by":"publisher","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\u00a071(2), 294\u2013301 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"44_CR14","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 J. Comput.\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:29:12Z","timestamp":1714620552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}