Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1506.01652

Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs

Archontia C. Giannopoulou·George B. Mertzios·Rolf Niedermeier
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus on a fundamental graph problem: Longest Path, that is, given an undirected graph, find a maximum-length path in $G$. Longest Path is NP-hard in general but known to be solvable in $O(n^{4})$ time on $n$-vertex interval graphs. We show how to solve Longest Path on Interval Graphs, parameterized by vertex deletion number $k$ to proper interval graphs, in $O(k^{9}n)$ time. Notably, Longest Path is trivially solvable in linear time on proper interval graphs, and the parameter value $k$ can be approximated up to a factor of 4 in linear time. From a more general perspective, we believe that using parameterized complexity analysis may enable a refined understanding of efficiency aspects for polynomial-time solvable problems similarly to what classical parameterized complexity analysis does for NP-hard problems.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier. 2021-01-04. Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. https://arxiv.org/abs/1506.01652

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An $Ω((\log n/\log\log n)^2)$ Cell-Probe Lower Bound for Dynamic Boolean Data Structures

We resolve the long-standing open problem of Boolean dynamic data structure hardness, proving an unconditional lower bound of $Ω((\log n/\log\log n)^2)$ for the Multiphase Problem of Patrascu [STOC 2010] (instantiated with Inner Product over $\mathbb{F}_2$). This matches the $\tildeΩ(\log^2 n)$ bound that Larsen [STOC 2012] established for weighted problems, where each query returns $Ω(\log n)$ bits, and closes the gap left by the $\tildeΩ(\log^{1.5} n)$ Boolean bound of Larsen, Weinstein, and Yu [STOC 2018]. It also answers, up to a $(\log\log n)^2$ factor, Open Question 15.24 in Viola's textbook "Mathematics of the Impossible" [Cambridge 2026]. The previous barrier was methodological: all prior works relied on "one-way" communication games, where the inability to verify query simulations necessitated complex machinery (such as the Peak-to-Average Lemma) that hit a hard ceiling at $\log^{1.5} n$. Our key contribution is conceptual: we introduce a 2.5-round Multiphase Communication Game that augments the standard one-way model with a verification round, where Bob confirms the consistency of Alice's simulation against the actual memory. This simple, qualitative change removes the obstruction and yields the full bound directly. As a consequence, our analysis naturally extends to other hard Boolean functions -- those of small discrepancy under product distributions with large min-entropy -- offering a general recipe for translating discrepancy lower bounds into $Ω((\log n/\log\log n)^2)$ dynamic Boolean data structure lower bounds. We also argue that this result likely represents the structural ceiling of the Chronogram framework initiated by Fredman and Saks [STOC 1989]: any $ω(\log^2 n)$ lower bound would require either fundamentally new techniques or major circuit complexity breakthroughs.

cs.CC↗
arXiv2026

Maltsev Constraint Satisfaction Problems and Deterministic Logspace With Counting

In this article, we prove that the problem of solving $\operatorname{CSP}(\mathbf{A})$, where $\mathbf{A}$ is a finite relational template which admits a Maltsev polymorphism is in a specific complexity class DET, which is related to the complexity of computing the determinant of a matrix with integer entries. Such a class is intimately related to well-studied MOD-logspace classes in the theory of computational complexity. To prove this fact, we develop a new algorithm for solving syntactically simple binary instances of Maltsev constraint satisfaction problems, rather different from the well-known Bulatov-Dalmau algorithm, which does not require the explicit use or knowledge of a Maltsev polymorphism of the template but, rather, utilizes a graph whose vertices are 2-generated subuniverses of $\mathbb{A}$, where $\mathbb{A}$ is the Maltsev algebra parametrizing $\operatorname{CSP}(\mathbf{A})$. The theoretical importance of this algorithm is reflected in two facts: (1) it places the problem $ \operatorname{CSP}(\mathbf{A})$ in a complexity class related to the deterministic logspace with counting, which, in itself, has a strong connection to a variety of standard algorithmic problems in linear algebra, and (2) it only makes use of the relational structure of the template without the need for the explicit use of a compatible Maltsev polymorphism, depending entirely on the strong ``symmetry" of constraints compatible with such polymorphisms and the knowledge of 2-generated subuniverses of $\mathbb{A}$.

cs.CC↗
arXiv2026

Linear Certificates for Membership Comparability, Quadratic Barriers for Selectors

Selectors and comparators supply only partial information about membership: a selector names a member of any pair that meets the language, while a binary membership comparator merely excludes one of the four membership vectors of a pair. We ask how much nonuniform advice turns such information into exact recognition. Our main result extends the optimal nondeterministic advice bound for P-selective sets to every binary membership-comparable language: $2-mc \subseteq NP /(3n+5)\cap\mathrm{coNP}/(3n+5)$, with common fixed advice and certificates of at most $5n+12$ bits. The class is strictly larger; some 2-mc sets are not truth-table reducible to any P-selective set. The proof replaces the tournament king by an independent two-step cover of true signed literals, together with a short-forcing-or-exact-majority dichotomy, and it relativizes. Via an advice-preserving isolation transfer, a deterministic polynomial-time algorithm for promise Unique-Circuit-SAT gives $2-mc \subseteq P/O(n)$. For selectors we determine tight orders of ordinary advice: $Θ(n)$ for errorless average-case computation and $Θ(n^2)$ for worst-case bounded-error computation, the latter independent of the interpreter's coin bound. One oracle realizes both orders on a single language and separates ordinary from coin-dependent advice. The quadratic and linear lower bounds hold for tournament-query procedures and relativized languages, not unconditionally for unrelativized P-selective sets.

cs.CC↗