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
    41 Citations
    Subexponential Parameterized Algorithm for Interval Completion
    • 31
    • PDF
    Subexponential parameterized algorithm for interval completion
    • 10
    • PDF
    Fixed-Parameter Complexity of Minimum Profile Problems
    • 28
    • PDF
    On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems
    • 25
    • PDF
    Minimum Leaf Out-Branching Problems
    • 26
    • PDF
    D S ] 1 3 Ja n 20 08 Parameterized Minimum Leaf Out-Branching Problems
    Minimum leaf out-branching and related problems
    • 44
    • PDF
    Solving MAX-r-SAT Above a Tight Lower Bound
    • 118
    • PDF
    Subexponential parameterized algorithm for minimum fill-in
    • 79
    • PDF
    Parameterized Minimum Leaf Out-Branching Problems
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
    • 154
    • Highly Influential
    • PDF
    Fixed-Parameter Complexity of Minimum Profile Problems
    • 28
    • Highly Influential
    • PDF
    The Profile Minimization Problem in Trees
    • 31
    • Highly Influential
    • PDF
    The MINSUMCUT Problem
    • 24
    • Highly Influential
    Four Strikes Against Physical Mapping of DNA
    • 191
    • Highly Influential
    • PDF
    Graph theory and Gaussian elimination.
    • 65
    • Highly Influential
    • PDF
    Representation of a finite graph by a set of intervals on the real line
    • 706
    • Highly Influential
    • PDF
    Computer solution of large sparse positive definite systems
    • 1,939
    • Highly Influential
    On rigid circuit graphs
    • 837
    • Highly Influential
    • PDF