Preprint
Aug 2026
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
This paper proves that the former two problems are fixed-parameter tractable when parameterized by the treedepth of the input graph, and shows that Set of Degrees MST remains W[1]-hard parameterized by treedepth, even when combined with the feedback vertex number.
Narek Bojikian, Alexander Firbas, R. Ganian et al.
· 0 citations