Metraipolis › archive › dc_263a3b601346
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter — arXiv:2610.22010
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22010
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:40:22.698Z
- SHA-256 of the archived text
f4ab97120f8a5687a8759d4677acf613b8348a9658b54c1eb2f248955f1280de- Stable URL of this page
https://metraipolis.com/documento/dc_263a3b601346
How to cite
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter — arXiv:2610.22010 — arXiv (en), https://arxiv.org/abs/2610.22010 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_263a3b601346 (Metraipolis archive dc_263a3b601346, sha256 f4ab97120f8a5687a8759d4677acf613b8348a9658b54c1eb2f248955f1280de)
BibTeX
@misc{dc263a3b601346,
title = {Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter — arXiv:2610.22010},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22010},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_263a3b601346; sha256 f4ab97120f8a5687a8759d4677acf613b8348a9658b54c1eb2f248955f1280de},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22010. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the fixed-parameter tractability of the \textsc{Isometric Path Cover} problem where, given an integer $k$ and a simple, undirected, and unweighted graph $G$, the objective is to decide whether $G$ admits a set of $k$ isometric paths (i.e., shortest paths between their endpoints) whose union is the entire vertex set of $G$. We show that \textsc{Isometric Path Cover} is NP-hard on graphs of pathwidth (and thus treewidth) at most 287. This is an interesting contrast with the closely related problems \textsc{Isometric Path Partition} and \textsc{Path Cover}, which are both known to be XP for treewidth, see [Chakraborty et al., WG 2026] and [Foucaud et al., TCS 2026]. On the positive side, we show, by a suitable dynamic programming scheme, that \textsc{Isometric Path Cover} admits an XP algorithm w.r.t.~the parameter combination of treewidth and diameter, running in time $n^{\diam^{O(\tw)}}$ where $\diam$, $\tw$, and $n$ denote the diameter, the treewidth, and the number of vertices of the input graph, respectively. However, we also prove that \textsc{Isometric Path Cover} becomes W[1]-hard for pathwidth on graphs of diameter~7, showing that an XP algorithm is the best one can hope for w.r.t.~this parameterization, under standard complexity theory assumptions.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2610.22010 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:53:17.677Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).