Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unit Interval Editing is Fixed-Parameter Tractable

Published 17 Apr 2015 in cs.DS | (1504.04470v2)

Abstract: Given a graph~GG and integers k1k_1, k2k_2, and~k3k_3, the unit interval editing problem asks whether GG can be transformed into a unit interval graph by at most k1k_1 vertex deletions, k2k_2 edge deletions, and k3k_3 edge additions. We give an algorithm solving this problem in time 2O(klog⁡k)⋅(n+m)2^{O(k\log k)}\cdot (n+m), where k:=k1+k2+k3k := k_1 + k_2 + k_3, and n,mn, m denote respectively the numbers of vertices and edges of GG. Therefore, it is fixed-parameter tractable parameterized by the total number of allowed operations. Our algorithm implies the fixed-parameter tractability of the unit interval edge deletion problem, for which we also present a more efficient algorithm running in time O(4k⋅(n+m))O(4^k \cdot (n + m)). Another result is an O(6k⋅(n+m))O(6^k \cdot (n + m))-time algorithm for the unit interval vertex deletion problem, significantly improving the algorithm of van 't Hof and Villanger, which runs in time O(6k⋅n6)O(6^k \cdot n^6).

Authors (1)
Citations (33)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.