Abstract
In the Proper Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999], who showed an algorithm for the problem working in O(16k · (n + m)) time. In this paper we present an algorithm with running time kO(k2/3) + O(nm(kn + m)), which is the first subexponential parameterized algorithm for Proper Interval Completion. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Bliznets, I., Fomin, F. V., Pilipczuk, M., & Pilipczuk, M. (2014). A subexponential parameterized algorithm for proper interval completion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 173–184). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
