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

arXiv:2610.30458 · cs.DM, cs.DS, math.CO · Submitted 2026-10-21 · Read on arXiv

cs.DM, cs.DS, math.CO

Submitted: 2026-10-21

Updated: 2026-10-21

Related papers