Polynomial Kernels for Interval Completion

2026-10-07

AI Summary

The original TLDR content is missing, precluding the extraction of specific research details. Accordingly, a generalized academic template is provided below; please replace the bracketed placeholders with actual information. To address the limitations of existing approaches in [specific domain], this work proposes [model/algorithm name], a method grounded in [core technology or theoretical framework]. By introducing [key innovative mechanism], it effectively overcomes the performance bottlenecks inherent in conventional solutions. Experimental evaluations demonstrate that the proposed method significantly outperforms existing baselines on [benchmark datasets or evaluation scenarios], achieving an improvement of [X]% in [core metric]. The primary contribution of this study lies in the novel integration of [Technology A] and [Technology B] to construct a [new paradigm/architecture], thereby offering an efficient and robust solution for [application domain].

Abstract

An interval graph is the intersection graph of a family of intervals on the real line. \textsc{Interval Completion} asks whether a given graph can be transformed into an interval graph by adding at most $k$ edges. Although the problem is fixed-parameter tractable when parameterized by $k$, whether it admits a polynomial kernel has long been an open question. We resolve this question by giving the first polynomial kernel for \textsc{Interval Completion}. Our main contribution is a parameter-preserving polynomial-time reduction from \textsc{Interval Completion} to \textsc{Odd Cycle Transversal} (OCT). Combining this reduction with the known randomized and deterministic polynomial kernels for OCT and a polynomial-time reduction back to \textsc{Interval Completion}, we obtain a randomized kernel with $\widetilde O(k^{18})$ vertices and $\widetilde O(k^{36})$ edges, and a deterministic kernel with $O(k^{36})$ vertices and $O(k^{72})$ edges. Here, $\widetilde O$ suppresses polylogarithmic factors in $k$.

Problem

• Interval Completion
• Polynomial Kernel
• Fixed-Parameter Tractability
• Interval Graph

Innovation

• Interval Completion
• Polynomial Kernel
• Odd Cycle Transversal
• Parameterized Complexity
• Kernelization