On Graphs Coverable by k Shortest Paths - Archive ouverte HAL
Journal Articles SIAM Journal on Discrete Mathematics Year : 2024

On Graphs Coverable by k Shortest Paths

Domains

Discrete Mathematics [cs.DM] Data Structures and Algorithms [cs.DS] Combinatorics [math.CO]

Florent Foucaud  : Connect in order to contact the contributor

https://hal.science/hal-04611604

Submitted on : Thursday, June 13, 2024-6:01:24 PM

Last modification on : Saturday, June 15, 2024-3:18:35 AM

Consult the full text

Dates and versions

hal-04611604 , version 1 (13-06-2024)

Identifiers

Cite

Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca. On Graphs Coverable by k Shortest Paths. SIAM Journal on Discrete Mathematics, 2024, 38 (2), pp.1840-1862. ⟨10.1137/23M1564511⟩. ⟨hal-04611604⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

PRES_CLERMONT CNRS UNIV-ORLEANS LIMOS TDS-MACS INSA-GROUPE CAP20-25 INSA-CVL ANR CLERMONT-AUVERGNE-INP
71 View
0 Download

Altmetric

Share

More