Abstract
Settling a ten years open question, we show that the NP-complete FEEDBACK VERTEX SET problem is deterministically solvable in O(ck·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 NP-complete EDGE BIPARTIZATION problem with runtime O(2k·m2). © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., & Wernicke, S. (2005). Improved fixed-parameter algorithms for two feedback set problems. In Lecture Notes in Computer Science (Vol. 3608, pp. 158–168). Springer Verlag. https://doi.org/10.1007/11534273_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
