• DOI:10.1145/1250790.1250847
Corpus ID: 746276

Interval completion with few edges

@inproceedings{Heggernes2007IntervalCW,
  title={Interval completion with few edges},
  author={P. Heggernes and C. Paul and J. Telle and Yngve Villanger},
  booktitle={STOC '07},
  year={2007}
}

P. Heggernes, C. Paul, +1 author Yngve Villanger

Published in STOC '07 2007

Mathematics, Computer Science

We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time f(k) * n(O(1)).The problem has applications in Physical Mapping of DNA and in Profile Minimization for Sparse Matrix Computations. For the first… CONTINUE READING

View on ACM

lirmm.fr

Save to Library

Create Alert

Cite

Launch Research Feed