论文标题
通配符的压缩：所有跨越规定的顶点degrees的树木
Compression with wildcards: All spanning trees with prescribed vertex-degrees
论文作者
论文摘要
通过处理图G的所有最小切割，并使用新型通配符，可以将所有跨越G的树木紧凑地编码。令人惊讶的是，尽管以完全无关的方式，但1986年的冬季算法似乎达到了完全相同的压缩（猜想2）！尽管Winter的算法更快，但我们的方法适应了任务的相关变化，例如仅列出那些跨越规定程度条件的树木
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
