Faster Parameterized Algorithms for Minimum Fill-In

Authors:
Hans L. Bodlaender;Pinar Heggernes;Yngve Villanger
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands 3508 TB;Department of Informatics, University of Bergen, Bergen, Norway 5020;Department of Informatics, University of Bergen, Bergen, Norway 5020
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 2

Minimum fill-in and treewidth of split+ke and split+kv graphs

Discrete Applied Mathematics
A parameterized algorithm for chordal sandwich

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

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.