1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Rahul CS, Michal Wlodarczyk
Deciding whether a graph has k-edge-disjoint spanning trees is a well-studied problem. We consider the problem of enumerating all sets of spanning trees with polynomial delay. This…