• DOI:10.1137/11085390X
Corpus ID: 934546

Subexponential parameterized algorithm for minimum fill-in

@inproceedings{Fomin2012SubexponentialPA,
  title={Subexponential parameterized algorithm for minimum fill-in},
  author={F. Fomin and Yngve Villanger},
  booktitle={SODA},
  year={2012}
}

F. Fomin, Yngve Villanger

Published in SODA 2012

Computer Science, Mathematics

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + k2nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterizedv algorithm solving Minimum Fill-in in time [EQUATION]. This substantially lowers the complexity of the problem. Techniques developed for Minimum Fill-in can be used to… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed