On graphs coverable with k shortest paths

2023-10-19 15:00 — 16:00 Famnit MP1 Maël DUMAS (University of Orléans, France) On graphs coverable with k shortest paths We show that if the edges or vertices of an undirected graph G can be covered by k shortest paths, then…