A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(c k · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NPcomplete Edge Bipartization problem with runtime O(2 k · m 2 ).doi:10.1007/11534273_15 fatcat:hxjgozqbdzg4vbpwxesls2riuy