Presentation 2012-07-03
On Minimum Feedback Vertex Sets in Graphs
Asahi TAKAOKA, Satoshi TAYU, Shuichi UENO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) For the minimum feedback vertex set problem, we show a linear time algorithm for bipartite permutation graphs, the NP-hardness for grid intersection graphs, and a polynomial time algorithm for graphs with maximum degree at most three.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) bipartite permutation graph / feedback vertex set / grid intersection graph / matroid parity problem
Paper # CAS2012-16,VLD2012-26,SIP2012-48,MSS2012-16
Date of Issue

Conference Information
Committee MSS
Conference Date 2012/6/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Mathematical Systems Science and its applications(MSS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Minimum Feedback Vertex Sets in Graphs
Sub Title (in English)
Keyword(1) bipartite permutation graph
Keyword(2) feedback vertex set
Keyword(3) grid intersection graph
Keyword(4) matroid parity problem
1st Author's Name Asahi TAKAOKA
1st Author's Affiliation Department of Communications and Integrated Systems, Tokyo Institute of Technology()
2nd Author's Name Satoshi TAYU
2nd Author's Affiliation Department of Communications and Integrated Systems, Tokyo Institute of Technology
3rd Author's Name Shuichi UENO
3rd Author's Affiliation Department of Communications and Integrated Systems, Tokyo Institute of Technology
Date 2012-07-03
Paper # CAS2012-16,VLD2012-26,SIP2012-48,MSS2012-16
Volume (vol) vol.112
Number (no) 116
Page pp.pp.-
#Pages 6
Date of Issue