Valency Hub
alphaFeedback
PDF

WorksComputer Science

Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers

Li-Hsuan Chen, Florent Foucaud, Ling-Ju Hung, Ralf Klasing, Lucas Lorieau

Published Fresh — added to the Hub within the last 30 daysv1

Publication details
License
CC BY 4.0
Status
Published
AI contributions
Not recorded for this paper
View details
Machine checks

No machine checks are available from the Hub API for this paper.