Complexity and algorithms for isometric path cover on chordal graphs and beyond

DOI10.4230/LIPICS.ISAAC.2022.12MaRDI QIDQ6602428zbMATH OpenFDO

Authors Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh

Publication date 11 September 2024

zbMATH Keywords

approximation algorithmshortest pathstreewidthFPT algorithminterval graphchordal graphchordalitytreelengthat-free graphisometric path cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• On graphs coverable by \({k}\) shortest paths
• Parameterizing path partitions
• Distance-based covering problems for graphs of given cyclomatic number

This page was built for publication: Complexity and algorithms for isometric path cover on chordal graphs and beyond

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