{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T03:17:19Z","timestamp":1787023039534,"version":"3.56.0"},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2015edl8021","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T18:41:58Z","timestamp":1438368118000},"page":"1589-1591","source":"Crossref","is-referenced-by-count":6,"title":["A Note on Irreversible 2-Conversion Sets in Subcubic Graphs"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Asahi","family":"TAKAOKA","sequence":"first","affiliation":[{"name":"Department of Communications and Computer Engineering, Tokyo Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuichi","family":"UENO","sequence":"additional","affiliation":[{"name":"Department of Communications and Computer Engineering, Tokyo Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] S.S. Adams, Z. Brass, C. Stokes, and D.S. Troxell, \u201cIrreversible <i>k<\/i>-threshold and majority conversion processes on complete multipartite graphs and graph products,\u201d Australasian Journal of Combinatorics, vol.56, pp.47-60, 2013."},{"key":"2","unstructured":"[2] Y. Cao, J. Chen, and Y. Liu, \u201cOn Feedback Vertex Set New Measure and New Structures,\u201d in Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), ser. Lecture Notes in Computer Science, vol.6139, pp.93-104, 2010."},{"key":"3","unstructured":"[3] C.C. Centeno, M.C. Dourado, L.D. Penso, D. Rautenbach, and J.L. Szwarcfiter, \u201cIrreversible conversion of graphs,\u201d Theoretical Computer Science, vol.412, no.29, pp.3693-3700, 2011."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] P.A. Dreyer Jr. and F.S. Roberts, \u201cIrreversible <i>k<\/i>-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion,\u201d Discrete Applied Mathematics, vol.157, no.7, pp.1615-1627, 2009.","DOI":"10.1016\/j.dam.2008.09.012"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M.L. Furst, J.L. Gross, and L.A. McGeoch, \u201cFinding a maximum-genus graph imbedding,\u201d Journal of the ACM, vol.35, no.3, pp.523-534, 1988.","DOI":"10.1145\/44483.44485"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] H.N. Gabow and M.F.M. Stallmann, \u201cEfficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract),\u201d in Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP), ser. Lecture Notes in Computer Science, vol.194, pp.210-220, 1985.","DOI":"10.1007\/BFb0015746"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] H.N. Gabow and M.F.M. Stallmann, \u201cAn augmenting path algorithm for linear matroid parity,\u201d Combinatorica, vol.6, no.2, pp.123-150, 1986.","DOI":"10.1007\/BF02579169"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] F.L. Gall, \u201cPowers of tensors and fast matrix multiplication,\u201d in Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC), pp.296-303, 2014.","DOI":"10.1145\/2608628.2608664"},{"key":"9","unstructured":"[9] J. Kyncl, B. Lidicky, and T. Vyskocil, \u201cIrreversible 2-conversion set is NP-complete,\u201d Department of Applied Mathematics (KAM), Charles University in Prague, Tech. Rep. KAM-DIMATIA Series 2009-933, 2009."},{"key":"10","unstructured":"[10] J. Kyncl, B. Lidicky, and T. Vyskocil, \u201cIrreversible 2-conversion set in graphs of bounded degree,\u201d arXiv: 1412.4188v1, pp.1-16, 2014."},{"key":"11","unstructured":"[11] L. Lov\u00e1sz, \u201cThe matroid matching problem,\u201d in Algebraic methods in graph theory, Vol.II, ser. Colloquia Mathematica Societatis J\u00e1nos Bolyai 25. North-Holland, pp.495-517, 1981."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Takaoka, S. Tayu, and S. Ueno, \u201cOn Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs,\u201d IEICE Transactions on Information and Systems, vol.E96-D, no.11, pp.2327-2332, Nov. 2013.","DOI":"10.1587\/transinf.E96.D.2327"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] S. Ueno, Y. Kajitani, and S. Gotoh, \u201cOn the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three,\u201d Discrete Mathematics, vol.72, no.1-3, pp.355-360, 1988.","DOI":"10.1016\/0012-365X(88)90226-9"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/8\/E98.D_2015EDL8021\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T19:55:30Z","timestamp":1567022130000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/8\/E98.D_2015EDL8021\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":13,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edl8021","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}