A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Faster Parameterized Algorithms for Minimum Fill-in
2010
Algorithmica
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 O(k 2 nm + 3.0793 k ), 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.
doi:10.1007/s00453-010-9421-1
fatcat:ejekaaqm3ngojn34p4nvq4rjzy