A Polynomial Bound on the Pathwidth of Graphs Edge-Coverable by k Shortest Paths.

Julien Baste, Lucas de Meyer, Ugo Giocanti, tienne Objois, Timoth Picavet

Browse the full STACS paper archive.