Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation


Philip,  Geevarghese
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Fomin, F. V., Philip, G., & Villanger, Y. (2011). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. In S. Chakraborty, & A. Kumar (Eds.), 31st International Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 164-175). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2011.164.

Cite as:
The \textscMinimum Fill-in} problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop kernelization algorithms for the problem on several classes of sparse graphs. We obtain linear kernels on planar graphs, and kernels of size O(k^{3/2}) in graphs excluding some fixed graph as a minor and in graphs of bounded degeneracy. As a byproduct of our results, we obtain approximation algorithms with approximation ratios O(\log{k}) on planar graphs and O(\sqrt{k}\log{k}) on H-minor-free graphs. These results significantly improve the previously known kernelization and approximation results for \textsc{Minimum Fill-in on sparse graphs.