"On graphs coverable by k shortest paths."

Maël Dumas et al. (2022)

Details and statistics

DOI: 10.48550/ARXIV.2206.15088

access: open

type: Informal or Other Publication

metadata version: 2022-07-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics