{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:27:07Z","timestamp":1725571627162},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_4","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"31-40","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Algorithm for Powerful Alliances in Trees"],"prefix":"10.1007","author":[{"given":"Ararat","family":"Harutyunyan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(90)90092-E","volume":"50","author":"R. Aharoni","year":"1990","unstructured":"Aharoni, R., Milner, E.C., Prikry, K.: Unfriendly partitions of a graph. J. Combin. Theory Ser. B\u00a050(1), 1\u201310 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"4_CR2","first-page":"23","volume":"58","author":"H. Balakrishnan","year":"2006","unstructured":"Balakrishnan, H., Cami, A., Deo, N., Dutton, R.D.: On the complexity of finding optimal global alliances. J. Combinatorial Mathematics and Combinatorial Computing\u00a058, 23\u201331 (2006)","journal-title":"J. Combinatorial Mathematics and Combinatorial Computing"},{"issue":"8","key":"4_CR3","doi-asserted-by":"publisher","first-page":"2140","DOI":"10.1016\/j.disc.2006.10.026","volume":"309","author":"R.C. Brigham","year":"2009","unstructured":"Brigham, R.C., Dutton, R.D., Haynes, T.W., Hedetniemi, S.T.: Powerful alliances in graphs. Discrete Mathematics\u00a0309(8), 2140\u20132147 (2009)","journal-title":"Discrete Mathematics"},{"key":"4_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2002","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill, New York (2002)"},{"key":"4_CR5","first-page":"76","volume":"187","author":"B.C. Dean","year":"2007","unstructured":"Dean, B.C., Jamieson, L.: Weighted Alliances in Graphs. Congressus Numerantium\u00a0187, 76\u201382 (2007)","journal-title":"Congressus Numerantium"},{"key":"4_CR6","unstructured":"Harutyunyan, A.: Some bounds in alliances in trees. In: Cologne Twente Workshop on Graphs and Combinatorial Optimization (2010) (accepted)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.37236\/1740","volume":"10","author":"T.W. Haynes","year":"2003","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Global defensive allliances in graphs. Electronic Journal of Combinatorics\u00a010(1), R47 (2003)","journal-title":"Electronic Journal of Combinatorics"},{"key":"4_CR8","first-page":"105","volume":"66","author":"T.W. Haynes","year":"2004","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: A characterization of trees with equal domination and global strong alliance numbers. Utilitas Mathematica\u00a066, 105\u2013119 (2004)","journal-title":"Utilitas Mathematica"},{"key":"4_CR9","first-page":"157","volume":"48","author":"S.M. Hedetniemi","year":"2004","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Kristiansen, P.: Alliances in graphs. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a048, 157\u2013177 (2004)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"4_CR10","first-page":"373","volume-title":"A tribute to Paul Erdos","author":"E.C. Milner","year":"1990","unstructured":"Milner, E.C., Shelah, S.: Graphs with no unfriendly partitions. In: A tribute to Paul Erdos, pp. 373\u2013384. Cambridge Univ. Press, Cambridge (1990)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2008.02.006","volume":"157","author":"J.A. Rodriguez-Velazquez","year":"2009","unstructured":"Rodriguez-Velazquez, J.A., Sigarreta, J.M.: On the global offensive alliance number of a graph. Discrete Applied Mathematics\u00a0157(2), 219\u2013226 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.7151\/dmgt.1351","volume":"27","author":"J.A. Rodriguez-Velazquez","year":"2007","unstructured":"Rodriguez-Velazquez, J.A., Sigarreta, J.M.: Spectal study of alliances in graphs. Discussiones Mathematicae Graph Theory\u00a027(1), 143\u2013157 (2007)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"36","key":"4_CR13","first-page":"1773","volume":"1","author":"J.A. Rodriquez-Velazquez","year":"2006","unstructured":"Rodriquez-Velazquez, J.A., Sigarreta, J.M.: Offensive alliances in cubic graphs. International Mathematical Forum\u00a01(36), 1773\u20131782 (2006)","journal-title":"International Mathematical Forum"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.endm.2006.06.074","volume":"25","author":"J.A. Rodriguez-Velazquez","year":"2006","unstructured":"Rodriguez-Velazquez, J.A., Sigarreta, J.M.: Global Offensive Alliances in Graphs. Electronic Notes in Discrete Mathematics\u00a025, 157\u2013164 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"12","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1016\/j.aml.2006.02.001","volume":"19","author":"J.A. Rodriguez-Velazquez","year":"2006","unstructured":"Rodriguez-Velazquez, J.A., Sigarreta, J.M.: On defensive alliances and line graphs. Applied Mathematics Letters\u00a019(12), 1345\u20131350 (2006)","journal-title":"Applied Mathematics Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T17:41:06Z","timestamp":1592156466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}