On graphs coverable by \({k}\) shortest paths
type: Item
instance of: scholarly article
title: On graphs coverable by \({k}\) shortest paths
author: Maël Dumas
author: Florent Foucaud
author: Anthony Perez
author: Ioan Todinca
published in: SIAM Journal on Discrete Mathematics
publication date: 2024-06-25T00:00:00Z
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7870755
zbMATH Keywords: covering problems
zbMATH Keywords: shortest paths
zbMATH Keywords: graph theory
zbMATH Keywords: parameterized algorithms
MaRDI profile type: MaRDI publication profile
cites work: A game of cops and robbers
cites work: Path covering problems and testing of printed circuits
cites work: Easy problems for tree-decomposable graphs
cites work: Strong geodetic problem in networks
cites work: Complexity and algorithms for isometric path cover on chordal graphs and beyond
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Parameterized Algorithms
cites work: On the approximation hardness of geodetic set and its variants
cites work: The disjoint shortest paths problem
cites work: Parameterizing path partitions
cites work: The isometric path number of a graph
cites work: Exact exponential algorithms.
cites work: Structurally parameterized \(d\)-scattered set
cites work: Parameterized Complexity of Geodetic Set
cites work: Q6147259
cites work: On the isometric path partition problem
cites work: Strong edge geodetic problem in networks
cites work: An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
cites work: Isometric-path numbers of block graphs
cites work: Graph minors. XIII: The disjoint paths problem
DOI: 10.1137/23M1564511
description: scientific article; zbMATH DE number 7870755