Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs

DOI10.1016/J.TCS.2017.05.017zbMATH Open1372.68124arXiv1506.01652OpenAlexW2617953066MaRDI QIDQ2402262

Author name not available (Why is that?)

Publication date: 7 September 2017

Published in: (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1506.01652

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402262)