On graphs coverable by k shortest paths - Archive ouverte HAL Access content directly
Conference Papers Year : 2022
No file

Dates and versions

hal-03895886 , version 1 (13-12-2022)

Identifiers

Cite

Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca. On graphs coverable by k shortest paths. 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩. ⟨hal-03895886⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More