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 achieve (Conjecture 2) exactly the same compression, although in totally unrelated ways! Although Winter's algorithm is faster, our method adapts to relevant variations of the task, e.g. to the enumeration of only those spanning trees that obey prescribed degree conditions

翻译：令人惊讶的是,1986年的Winter算法似乎实现了完全相同的压缩(假设2),尽管在完全无关的方式上。 尽管Winter的算法速度更快,但我们的方法适应了任务的相关变化,例如只列举那些符合规定程度条件的横贯树木。