Abstract
We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal Completion: given an arbitrary graph G and integer k, can we add at most k edges to G to obtain a chordal graph? Our first algorithm has running time , and requires polynomial space. This improves the base of the exponential part of the best known parameterized algorithm time for this problem so far. We are able to improve this running time even further, at the cost of more space. Our second algorithm has running time and requires space. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Bodlaender, H. L., Heggernes, P., & Villanger, Y. (2008). Faster parameterized algorithms for minimum fill-in. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5369 LNCS, pp. 282–293). https://doi.org/10.1007/978-3-540-92182-0_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
