On graphs coverable by k shortest paths

DOI10.1137/23M1564511MaRDI QIDQ6561322zbMATH OpenFDO

Authors Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca

Publication date 25 June 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph theoryshortest pathsparameterized algorithmscovering problems

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• scientific article; zbMATH DE number 7788350 (Why is no real title available?)
• A game of cops and robbers
• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
• Complexity and algorithms for isometric path cover on chordal graphs and beyond
• Easy problems for tree-decomposable graphs
• Exact exponential algorithms.
• Graph minors. XIII: The disjoint paths problem
• Isometric-path numbers of block graphs
• On the approximation hardness of geodetic set and its variants
• On the isometric path partition problem
• Parameterized Complexity of Geodetic Set
• Parameterized algorithms
• Parameterizing path partitions
• Path covering problems and testing of printed circuits
• Strong edge geodetic problem in networks
• Strong geodetic problem in networks
• Structurally parameterized \(d\)-scattered set
• The disjoint shortest paths problem
• The isometric path number of a graph
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(1)

• Parameterizing path partitions

This page was built for publication: On graphs coverable by \({k}\) shortest paths

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