{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T01:54:03Z","timestamp":1673142843387},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014fcp0007","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T17:41:05Z","timestamp":1425145265000},"page":"486-489","source":"Crossref","is-referenced-by-count":1,"title":["Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Kazuyuki","family":"AMANO","sequence":"first","affiliation":[{"name":"Depertment of Computer Science, Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyaw May","family":"OO","sequence":"additional","affiliation":[{"name":"University of Computer Studies, Yangon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yota","family":"OTACHI","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"UEHARA","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] R.C. Brigham, R.D. Dutton, and S.T. Hedetniemi, \u201cSecurity in graphs,\u201d Discrete Appl. Math., vol.155, pp.1708-1714, 2007."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] F.R.K. Chung, Z. F\u00fcredi, R.L. Graham, and P.D. Seymour, \u201cOn induced subgraphs of the cube,\u201d J. Comb. Theory, Ser. A, vol.49, pp.180-187, 1988.","DOI":"10.1016\/0097-3165(88)90034-9"},{"key":"3","unstructured":"[3] R.D. Dutton, \u201cThe evolution of a hard graph theory problem \u2014 secure sets,\u201d A course material of COT 6410: Computational Complexity, University of Central Florida, 2010. Available at http:\/\/www.cs.ucf.edu\/courses\/cot6410\/spr2010\/doc\/SecureSets.doc"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R.D. Dutton, \u201cOn a graph&apos;s security number,\u201d Discrete Math., vol.309, pp.4443-4447, 2009.","DOI":"10.1016\/j.disc.2009.02.005"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R.D. Dutton, R. Lee, and R.C. Brigham, \u201cBounds on a graph&apos;s security number,\u201d Discrete Appl. Math., vol.156, pp.695-704, 2008.","DOI":"10.1016\/j.dam.2007.08.037"},{"key":"6","unstructured":"[6] R.I. Enciso and R.D. Dutton, \u201cAlgorithms for defensive alliance problems,\u201d Available at http:\/\/www.cs.ucf.edu\/~renciso\/DA.pdf"},{"key":"7","unstructured":"[7] R.I. Enciso and R.D. Dutton, \u201cParameterized complexity of secure sets,\u201d Congr. Numer., vol.189, pp.161-168, 2008."},{"key":"8","unstructured":"[8] L. Eroh and R. Gera, \u201cAlliance partition number in graphs,\u201d Ars Comb., vol.103, pp.519-529, 2012."},{"key":"9","unstructured":"[9] H. Fernau and D. Raible, \u201cAlliances in graphs: A complexity-theoretic study,\u201d SOFSEM (2), pp.61-70, 2007."},{"key":"10","unstructured":"[10] G.H. Fricke, L.M. Lawson, T.W. Haynes, S.M. Hedetniemi, and S.T. Hedetniemi, \u201cA note on defensive alliances in graphs,\u201d Bull. Inst. Combin. Appl., vol.38, pp.37-41, 2003."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] L.H. Harper, \u201cOptimal numberings and isoperimetric problems on graphs,\u201d J. Combin. Theory, vol.1, pp.385-393, 1966.","DOI":"10.1016\/S0021-9800(66)80059-5"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] G. Isaak, P. Johnson, and C. Petrie, \u201cInteger and fractional security in graphs,\u201d Discrete Appl. Math., vol.160, pp.2060-2062, 2012.","DOI":"10.1016\/j.dam.2012.04.018"},{"key":"13","unstructured":"[13] L.H. Jamieson, S.T. Hedetniemi, and A.A. McRae, \u201cThe algorithmic complexity of alliances in graphs,\u201d J. Combin. Math. Combin. Comput., vol.68, pp.137-150, 2009."},{"key":"14","unstructured":"[14] P. Kristiansen, S.M. Hedetniemi, and S.T. Hedetniemi, \u201cAlliances in graphs,\u201d J. Combin. Math. Combin. Comput., vol.48, pp.157-177, 2004."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Mitzenmacher and E. Upfal, Probability and computing: Randomized algorithms and probabilistic analysis, Cambridge University Press, 2005.","DOI":"10.1017\/CBO9780511813603"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] C. Petrie, \u201c(<i>F<\/i>,<i>I<\/i>)-security in graphs,\u201d Discrete Appl. Math., vol.162, pp.285-295, 2014.","DOI":"10.1016\/j.dam.2013.07.005"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R. Squier, B. Torrence, and A. Vogt, \u201cThe number of edges in a subgraph of a Hamming graph,\u201d Appl. Math. Lett., vol.14, pp.701-705, 2001.","DOI":"10.1016\/S0893-9659(01)80030-6"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0007\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T08:05:29Z","timestamp":1566374729000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014FCP0007\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014fcp0007","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}