{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:16:19Z","timestamp":1743221779560,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_34","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T01:44:33Z","timestamp":1338169473000},"page":"393-404","source":"Crossref","is-referenced-by-count":3,"title":["A Decomposition Approach for Solving Critical Clique Detection Problems"],"prefix":"10.1007","author":[{"given":"Jose L.","family":"Walteros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6794","key":"34_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R. Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barabasi, A.-L.: Error and attack tolerance of complex networks. Nature\u00a0406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"issue":"7","key":"34_CR2","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A. Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Computers and Operations Research\u00a036(7), 2193\u20132200 (2009)","journal-title":"Computers and Operations Research"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"Boppana, R., Halldorsson, M.: Approximating maximum independent sets by excluding subgraphs. BIT\u00a032, 180\u2013196 (1992)","journal-title":"BIT"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"S.P. Borgatti","year":"2006","unstructured":"Borgatti, S.P.: Identifying sets of key players in a social network. Comput. Math. Organ. Theory\u00a012, 21\u201334 (2006)","journal-title":"Comput. Math. Organ. Theory"},{"issue":"4","key":"34_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0167-6377(82)90020-7","volume":"1","author":"H. Corley","year":"1982","unstructured":"Corley, H., Sha, D.Y.: Most vital links and nodes in weighted networks. Operations Research Letters\u00a01(4), 157\u2013160 (1982)","journal-title":"Operations Research Letters"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Jansson, J., Lingas, A., Lundell, E.-M., Persson, M.: On the approximability of maximum and minimum edge clique partition problems. International Journal of Foundations of Computer Science\u00a018 (2006, 2007)","DOI":"10.1142\/S0129054107004656"},{"issue":"12","key":"34_CR7","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M. Di Summa","year":"2011","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees. Computers and Operations Research\u00a038(12), 1766\u20131774 (2011)","journal-title":"Computers and Operations Research"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Xuan, Y., Thai, M.T., Pardalos, P.M., Znati, T.: On new approaches of assessing network vulnerability: Hardness and approximation. IEEE\/ACM Transactions on Networking PP(99) (2011)","DOI":"10.1109\/TNET.2011.2170849"},{"key":"34_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C., Stoer, M.: Design of survivable networks. In: Ball, C.M.M.O., Magnanti, T.L., Nemhauser, G. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 617\u2013672. Elsevier (1995)","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Mathematical Programming\u00a047, 367\u2013387 (1990)","journal-title":"Mathematical Programming"},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1177\/0160017607308679","volume":"31","author":"T.H. Grubesic","year":"2008","unstructured":"Grubesic, T.H., Matisziw, T.C., Murray, A.T., Snediker, D.: Comparative approaches for assessing network vulnerability. International Regional Science Review\u00a031(1), 88\u2013112 (2008)","journal-title":"International Regional Science Review"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM\u00a016, 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"4","key":"34_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/bltj.10093","volume":"8","author":"D.J. Houck","year":"2004","unstructured":"Houck, D.J., Kim, E., O\u2019Reilly, G.P., Picklesimer, D.D., Uzunalioglu, H.: A network survivability model for critical national infrastructures. Bell Labs Technical Journal\u00a08(4), 153\u2013172 (2004)","journal-title":"Bell Labs Technical Journal"},{"issue":"7","key":"34_CR15","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/j.tra.2005.11.003","volume":"40","author":"E. Jenelius","year":"2006","unstructured":"Jenelius, E., Petersen, T., Mattsson, L.-G.: Importance and exposure in road network vulnerability analysis. Transportation Research Part A: Policy and Practice\u00a040(7), 537\u2013560 (2006)","journal-title":"Transportation Research Part A: Policy and Practice"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"T.C. Matisziw","year":"2009","unstructured":"Matisziw, T.C., Murray, A.T.: Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. Comput. Oper. Res.\u00a036, 16\u201326 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"34_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1111\/j.1467-9574.2007.00350.x","volume":"61","author":"M. Oosten","year":"2007","unstructured":"Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: Disconnecting graphs by removing vertices: a polyhedral approach. Statistica Neerlandica\u00a061(1), 35\u201360 (2007)","journal-title":"Statistica Neerlandica"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Palmer, C., Steffan, J.: Generating network topologies that obey power laws. In: Global Telecommunications Conference, GLOBECOM 2000, vol.\u00a01, pp. 434\u2013438. IEEE (2000)","DOI":"10.1109\/GLOCOM.2000.892042"},{"issue":"2","key":"34_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"J. Salmeron","year":"2004","unstructured":"Salmeron, J., Wood, K., Baldick, R.: Analysis of electric grid security under terrorist threat. IEEE Transactions on Power Systems\u00a019(2), 905\u2013912 (2004)","journal-title":"IEEE Transactions on Power Systems"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Shen, S., Smith, J.C.: Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks (2011)","DOI":"10.1002\/net.20464"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Tao, Z., Zhongqian, F., Binghong, W.: Epidemic dynamics on complex networks. Progress in Natural Science\u00a016(5) (2005)","DOI":"10.1080\/10020070612330019"},{"issue":"6","key":"34_CR22","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R. Wollmer","year":"1964","unstructured":"Wollmer, R.: Removing arcs from a network. Operations Research\u00a012(6), 934\u2013940 (1964)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:44:19Z","timestamp":1743201859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}