Show simple item record

dc.contributor.authorFomin, Fedor
dc.contributor.authorGeevarghese, Philip
dc.contributor.authorVillanger, Yngve
dc.identifier.citationLeibniz International Proceedings in Informatics 2011, 13:164-175eng
dc.description.abstractThe Minimum 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 Minimum Fill-in on sparse graphs.eng
dc.publisherDagstuhl Publishingeng
dc.rightsAttribution CC BY-NC-ND 3.0eng
dc.subjectMinimum Fill-Ineng
dc.subjectSparse graphseng
dc.titleMinimum Fill-in of Sparse Graphs: Kernelization and Approximationeng
dc.typeConference objecteng
dc.rights.holderCopyright Fedor V. Fomin, Geevarghese Philip, and Yngve Villangereng
bora.peerreviewedPeer reviewedeng
dc.type.documentJournal article

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution CC BY-NC-ND 3.0
Except where otherwise noted, this item's license is described as Attribution CC BY-NC-ND 3.0