@article{oai:muroran-it.repo.nii.ac.jp:00010260,
 author = {髙岡, 旭 and TAKAOKA, Asahi and UENO, Shuichi and 上野, 修一},
 issue = {8},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, Irreversible k-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or opinions. We show that the problem to find a minimum irreversible 2-conversion set can be solved in O(n(2) log(6) n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph. This affirmatively settles an open question posed by Kyncl et al. (2014).},
 pages = {1589--1591},
 title = {A Note on Irreversible 2-Conversion Sets in Subcubic Graphs},
 volume = {E98D},
 year = {2015},
 yomi = {タカオカ, アサヒ and ウエノ, シュウイチ}
}