{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:08:35Z","timestamp":1743012515275,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_23","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"285-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Computational Complexity of Vertex Integrity and Component Order Connectivity"],"prefix":"10.1007","author":[{"given":"P\u00e5l Gr\u00f8n\u00e5s","family":"Drange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus Sortland","family":"Dregi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(92)90122-Q","volume":"37","author":"KS Bagga","year":"1992","unstructured":"Bagga, K.S., Beineke, L.W., Goddard, W., Lipman, M.J., Pippert, R.E.: A survey of integrity. Discr. Appl. Math. 37, 13\u201328 (1992)","journal-title":"Discr. Appl. Math."},{"issue":"38","key":"23_CR2","first-page":"13","volume":"1","author":"CA Barefoot","year":"1987","unstructured":"Barefoot, C.A., Entringer, R., Swart, H.: Vulnerability in graphs\u2013a comparative survey. J. Combin. Math. Combin. Comput. 1(38), 13\u201322 (1987)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-38768-5_31","volume-title":"Computing and Combinatorics","author":"W Ben-Ameur","year":"2013","unstructured":"Ben-Ameur, W., Mohamed-Sidi, M.-A., Neto, J.: The k-separator problem. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 337\u2013348. Springer, Heidelberg (2013)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2005.09.027","volume":"349","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1), 22\u201330 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR6","first-page":"179","volume":"2","author":"LH Clark","year":"1987","unstructured":"Clark, L.H., Entringer, R.C., Fellows, M.R.: Computational complexity of integrity. J. Combin. Math. Combin. Comput. 2, 179\u2013191 (1987)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"23_CR7","unstructured":"Drange, P.G., Dregi, M.S., van \u2019t Hof, P.: On the Computational Complexity of Vertex Integrity. CoRR, abs\/1403.6331 (2014)"},{"key":"23_CR8","first-page":"23","volume":"6","author":"M Fellows","year":"1989","unstructured":"Fellows, M., Stueckle, S.: The immersion order, forbidden subgraphs and the complexity of network integrity. J. Combin. Math. Combin. Comput. 6, 23\u201332 (1989)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"23_CR9","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)"},{"key":"23_CR10","first-page":"895","volume":"12","author":"D Gross","year":"2013","unstructured":"Gross, D., Heinig, M., Iswara, L., Kazmierczak, L.W., Luttrell, K., Saccoman, J.T., Suffel, C.: A survey of component order connectivity models of graph theoretic networks. WSEAS Trans. Math. 12, 895\u2013910 (2013)","journal-title":"WSEAS Trans. Math."},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(89)90070-7","volume":"31","author":"CW Ho","year":"1989","unstructured":"Ho, C.W., Lee, R.C.T.: Counting clique trees and computing perfect elimination schemes in parallel. Inf. Process. Lett. 31(2), 61\u201368 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(96)00133-3","volume":"77","author":"D Kratsch","year":"1997","unstructured":"Kratsch, D., Kloks, T., M\u00fcller, H.: Measuring the vulnerability for classes of intersection graphs. Discr. Appl. Math. 77(3), 259\u2013270 (1997)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/00207160701365721","volume":"85","author":"Y Li","year":"2008","unstructured":"Li, Y., Zhang, S., Zhang, Q.: Vulnerability parameters of split graphs. Int. J. Comput. Math. 85(1), 19\u201323 (2008)","journal-title":"Int. J. Comput. Math."},{"key":"23_CR14","first-page":"65","volume":"16","author":"S Ray","year":"1994","unstructured":"Ray, S., Deogun, J.S.: Computational complexity of weighted integrity. J. Combin. Math. Combin. Comput. 16, 65\u201373 (1994)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"23_CR15","first-page":"77","volume":"79","author":"S Ray","year":"2006","unstructured":"Ray, S., Kannan, R., Zhang, D., Jiang, H.: The weighted integrity problem is polynomial for interval graphs. Ars Comb. 79, 77\u201395 (2006)","journal-title":"Ars Comb."},{"issue":"1\u20133","key":"23_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0012-365X(98)00156-3","volume":"190","author":"GJ Woeginger","year":"1998","unstructured":"Woeginger, G.J.: The toughness of split graphs. Discr. Math. 190(1\u20133), 295\u2013297 (1998)","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T00:42:45Z","timestamp":1674175365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}