1 paper · 1 filter
Tala Eagling-Vose, David C. Kutner, Felicia Lucke +4
Our main result is a full classification, for every connected graph H, of the computational complexity of Steiner Forest on H-subgraph-free graphs. To obtain this dichotomy, we…