40 citations · 64 across the 27 of their papers we have counts for
1 paper · 2 filters
Marcel Wild
By processing all minimal cutsets of a graph G, and by using novel wildcards, all spanning trees of G can be compactly encoded. Surprisingly, a 1986 algorithm of Winter seems to ac…