{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:44:54Z","timestamp":1772293494191,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T00:00:00Z","timestamp":1346198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10479-012-1200-8","type":"journal-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T07:15:06Z","timestamp":1346138106000},"page":"229-249","source":"Crossref","is-referenced-by-count":7,"title":["Games induced by the partitioning of a graph"],"prefix":"10.1007","volume":"201","author":[{"given":"M.","family":"Grabisch","sequence":"first","affiliation":[]},{"given":"A.","family":"Skoda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,29]]},"reference":[{"issue":"4","key":"1200_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/A:1010344404281","volume":"50","author":"E. Algaba","year":"2001","unstructured":"Algaba, E., Bilbao, J. M., & Lopez, J. J. (2001). A unified approach to restricted games. Theory and Decision, 50(4), 333\u2013345.","journal-title":"Theory and Decision"},{"key":"1200_CR2","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-642-10841-9_40","volume-title":"Proceedings of the 5th international workshop on internet and network economics, WINE\u201909","author":"H. Aziz","year":"2009","unstructured":"Aziz, H., Lachish, O., Paterson, M., & Savani, R. (2009). Wiretapping a hidden network. In Proceedings of the 5th international workshop on internet and network economics, WINE\u201909 (pp. 438\u2013446). Berlin: Springer."},{"key":"1200_CR3","unstructured":"Borm, P., Owen, G., & Tijs, S. (1990). Values of points and arcs in communication situations (Technical report 9004). Dept of Mathematics, University of Nijmegen, The Netherlands."},{"issue":"3","key":"1200_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W. H. Cunningham","year":"1985","unstructured":"Cunningham, W. H. (1985). Optimal attack and reinforcement of a network. Journal of the ACM, 32(3), 549\u2013561.","journal-title":"Journal of the ACM"},{"issue":"6","key":"1200_CR5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01415939","volume":"33","author":"U. Faigle","year":"1989","unstructured":"Faigle, U. (1989). Cores of games with restricted cooperation. ZOR.Methods and Models of Operations Research, 33(6), 405\u2013422.","journal-title":"ZOR.Methods and Models of Operations Research"},{"key":"1200_CR6","first-page":"69","volume-title":"Research trends in combinatorial optimization","author":"J. Fonlupt","year":"2008","unstructured":"Fonlupt, J., & Skoda, A. (2008). Strongly polynomial algorithm for the intersection of a line with a polymatroid. In Research trends in combinatorial optimization (pp. 69\u201385). Berlin: Springer."},{"key":"1200_CR7","series-title":"Annals of discrete mathematics","volume-title":"Submodular functions and optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S. (2005). Annals of discrete mathematics: Vol.\u00a058. Submodular functions and optimization (2nd\u00a0edn.). Amsterdam: Elsevier.","edition":"2"},{"issue":"3","key":"1200_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10288-009-0109-9","volume":"7","author":"M. Grabisch","year":"2009","unstructured":"Grabisch, M. (2009). The core of games on ordered structures and graphs. 4OR: A Quarterly Journal of Operations Research, 7(3), 207\u2013238.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"4","key":"1200_CR9","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0220040","volume":"20","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D. (1991). Computing the strength of a graph. SIAM Journal on Computing, 20(4), 639\u2013654.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"1200_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/moor.2.3.225","volume":"2","author":"R. B. Myerson","year":"1977","unstructured":"Myerson, R. B. (1977). Graphs and cooperation in games. Mathematics of Operations Research, 2(3), 225\u2013229.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"1200_CR11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0607025","volume":"7","author":"G. Owen","year":"1986","unstructured":"Owen, G. (1986). Values of graph-restricted games. SIAM Journal on Algebraic and Discrete Methods, 7(2), 210\u2013220.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"1200_CR12","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A. (2003). Combinatorial optimization: polyhedra and efficiency. Berlin: Springer."},{"issue":"2","key":"1200_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.bulsci.2008.10.003","volume":"133","author":"A. Skoda","year":"2009","unstructured":"Skoda, A. (2009). A new algorithm for the intersection of a line with the independent set polytope of a matroid. Bulletin des Sciences Math\u00e9matiques, 133(2), 169\u2013185.","journal-title":"Bulletin des Sciences Math\u00e9matiques"},{"issue":"4","key":"1200_CR14","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01766431","volume":"19","author":"A. Nouweland van den","year":"1991","unstructured":"van den Nouweland, A., & Borm, P. (1991). On the convexity of communication games. International Journal of Game Theory, 19(4), 421\u2013430.","journal-title":"International Journal of Game Theory"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1200-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1200-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1200-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:37Z","timestamp":1559138977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1200-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,29]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["1200"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1200-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,29]]}}}