{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:03:07Z","timestamp":1725570187626},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342653"},{"type":"electronic","value":"9783642342660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34266-0_9","type":"book-chapter","created":{"date-parts":[[2012,11,4]],"date-time":"2012-11-04T23:49:04Z","timestamp":1352072944000},"page":"152-170","source":"Crossref","is-referenced-by-count":9,"title":["Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality"],"prefix":"10.1007","author":[{"given":"Aron","family":"Laszka","sequence":"first","affiliation":[]},{"given":"D\u00e1vid","family":"Szeszl\u00e9r","sequence":"additional","affiliation":[]},{"given":"Levente","family":"Butty\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Gueye, A., Marbukh, V., Walrand, J.C.: Toward a metric for communication network vulnerability to attacks: A game theoretic approach. In: Proc. of the 3rd International ICST Conference on Game Theory for Networks, GameNets 2012, Vancouver, Canada (May 2012)","DOI":"10.1007\/978-3-642-35582-0_20"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W. Cunningham","year":"1985","unstructured":"Cunningham, W.: Optimal attack and reinforcement of a network. Journal of the ACM\u00a032(3), 549\u2013561 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D. Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.: Toughness in graphs\u2013a survey. Graphs and Combinatorics\u00a022(1), 1\u201335 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Laszka, A., Butty\u00e1n, L., Szeszl\u00e9r, D.: Optimal selection of sink nodes in wireless sensor networks in adversarial environments. In: Proc. of the 12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia, WoWMoM 2011, Lucca, Italy, pp. 1\u20136 (June 2011)","DOI":"10.1109\/WoWMoM.2011.5986167"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17197-0_1","volume-title":"Decision and Game Theory for Security","author":"A. Gueye","year":"2010","unstructured":"Gueye, A., Walrand, J.C., Anantharam, V.: Design of Network Topology in an Adversarial Environment. In: Alpcan, T., Butty\u00e1n, L., Baras, J.S. (eds.) GameSec 2010. LNCS, vol.\u00a06442, pp. 1\u201320. Springer, Heidelberg (2010)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Gueye, A., Walrand, J.C., Anantharam, V.: A network topology design game: How to choose communication links in an adversarial environment? In: Proc. of the 2nd International ICST Conference on Game Theory for Networks, GameNets 2011, Shanghai, China (April 2011)","DOI":"10.1007\/978-3-642-30373-9_17"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Laszka, A., Szeszl\u00e9r, D., Butty\u00e1n, L.: Game-theoretic robustness of many-to-one networks. In: Proc. of the 3rd International ICST Conference on Game Theory for Networks, GameNets 2012, Vancouver, Canada (May 2012)","DOI":"10.1007\/978-3-642-35582-0_7"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Schwartz, G.A., Amin, S., Gueye, A., Walrand, J.: Network design game with both reliability and security failures. In: Proc. of the 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 675\u2013681. IEEE (September 2011)","DOI":"10.1109\/Allerton.2011.6120233"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research\u00a034(2), 250\u2013256 (1986)","journal-title":"Operations Research"},{"key":"9_CR10","series-title":"Number\u00a092 in CBMS Regional Conference Series in Mathematics","volume-title":"Spectral graph theory","author":"F.R.K. Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral graph theory. Number\u00a092 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence (1997)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F.R.K. Chung","year":"2005","unstructured":"Chung, F.R.K.: Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics\u00a09(1), 1\u201319 (2005)","journal-title":"Annals of Combinatorics"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S096354839700299X","volume":"6","author":"N. Alon","year":"1997","unstructured":"Alon, N.: On the edge-expansion of graphs. Combinatorics, Probability and Computing\u00a06(2), 145\u2013152 (1997)","journal-title":"Combinatorics, Probability and Computing"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Alon, N.: Spectral techniques in graph algorithms. In: Proc. of the 3rd Latin American Symposium on Theoretical Informatics, Campinas, Brazil, pp. 206\u2013215 (April 1998)","DOI":"10.1007\/BFb0054322"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(89)90029-4","volume":"47","author":"B. Mohar","year":"1989","unstructured":"Mohar, B.: Isoperimetric numbers of graphs. Journal of Combinatorial Theory, Series B\u00a047(3), 274\u2013291 (1989)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0024-3795(88)90224-8","volume":"103","author":"B. Mohar","year":"1988","unstructured":"Mohar, B.: Isoperimetric inequalities, growth, and the spectrum of graphs. Linear Algebra and Its Applications\u00a0103, 119\u2013131 (1988)","journal-title":"Linear Algebra and Its Applications"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"B\u00fchler, T., Hein, M.: Spectral clustering based on the graph p-Laplacian. In: Proc. of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Canada, pp. 81\u201388 (June 2009)","DOI":"10.1145\/1553374.1553385"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34266-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T21:30:47Z","timestamp":1643578247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34266-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342653","9783642342660"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34266-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}