{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:33:41Z","timestamp":1648524821957},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1093\/comjnl\/bxv089","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T16:39:04Z","timestamp":1462898344000},"page":"616-629","source":"Crossref","is-referenced-by-count":0,"title":["Computing Global Secure Set on Trees"],"prefix":"10.1093","volume":"59","author":[{"given":"Jia-Jie","family":"Liu","sequence":"first","affiliation":[]},{"given":"Cheng-Ju","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Chien-Hung","family":"Lin","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,11,23]]},"reference":[{"key":"2016060203540687000_59.5.616.1","doi-asserted-by":"crossref","first-page":"\u266fR47","DOI":"10.37236\/1740","article-title":"Global defensive alliances in graphs","volume":"10","author":"Haynes","year":"2003","journal-title":"Electron. J. Combin."},{"key":"2016060203540687000_59.5.616.2","first-page":"157","article-title":"Alliances in graphs","volume":"48","author":"Kristiansen","year":"2004","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2016060203540687000_59.5.616.3","first-page":"187","article-title":"Lower bounds for global alliances on planar graphs","volume":"187","author":"Enciso","year":"2007","journal-title":"Congr. Numer."},{"key":"2016060203540687000_59.5.616.4","first-page":"37","article-title":"A note on defensive alliances in graphs","volume":"38","author":"Fricke","year":"2003","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2016060203540687000_59.5.616.5","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2006.02.001"},{"key":"2016060203540687000_59.5.616.6","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1230"},{"key":"2016060203540687000_59.5.616.7","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.12988\/imf.2006.06152","article-title":"Offensive alliances of cubic graphs","volume":"1","author":"Rodr\u00edguez-Vel\u00e1zquez","year":"2006","journal-title":"Int. Math. Forum"},{"key":"2016060203540687000_59.5.616.8","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2006.06.074"},{"key":"2016060203540687000_59.5.616.9","first-page":"57","article-title":"A sharp lower bound on the powerful alliance number of $C_m \\times C_n$","volume":"167","author":"Brigham","year":"2004","journal-title":"Congr. Numer."},{"key":"2016060203540687000_59.5.616.10","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9423-2"},{"key":"2016060203540687000_59.5.616.11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.01.005"},{"key":"2016060203540687000_59.5.616.12","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1351"},{"key":"2016060203540687000_59.5.616.13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.03.009"},{"key":"2016060203540687000_59.5.616.14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.037"},{"key":"2016060203540687000_59.5.616.15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.12.013"},{"key":"2016060203540687000_59.5.616.16","doi-asserted-by":"crossref","unstructured":"Ho Y. Y. (2011) Global secure sets of trees and grid-like graphs. PhD Dissertation, University of Central Florida, Summer.","DOI":"10.1016\/j.dam.2010.12.013"},{"key":"2016060203540687000_59.5.616.17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.03.022"},{"key":"2016060203540687000_59.5.616.18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.10.004"},{"key":"2016060203540687000_59.5.616.19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.03.020"},{"key":"2016060203540687000_59.5.616.20","first-page":"373","article-title":"Rooted secure sets of trees","volume":"6","author":"Ho","year":"2009","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2016060203540687000_59.5.616.21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.204"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/5\/616\/7902950\/bxv089.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T17:16:59Z","timestamp":1600535819000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,23]]},"references-count":21,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,5,10]]},"published-print":{"date-parts":[[2016,5]]}},"alternative-id":["10.1093\/comjnl\/bxv089"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv089","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,23]]}}}