@article{oai:muroran-it.repo.nii.ac.jp:00010264,
 author = {髙岡, 旭 and TAKAOKA, Asahi and TAYU, Satoshi and 田湯, 智 and UENO, Shuichi and 上野, 修一},
 issue = {11},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n(2) log(6) n) time for n-vertex graphs with maximum degree at most three.},
 pages = {2327--2332},
 title = {On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs},
 volume = {E96D},
 year = {2013},
 yomi = {タカオカ, アサヒ and タユ, サトシ and ウエノ, シュウイチ}
}