Black-white pebbles and graph separation
Black-white pebbles and graph separation
复制标题
黑白鹅卵石和图形分离
作者：
Thomas Lengauer
总结我们展示了计算复杂性的两个主题之间的密切关系。一个主题是分析不确定性计算的存储需求。相应的数学模型是一个著名的黑白卵石游戏上的有向无环图。另一个主题是寻找无向图的小分隔符。我们建立了一个动态版本的概念，一个顶点分离器游戏的分离器。这个游戏与图形布局和搜索问题密切相关。我们表明，黑白卵石游戏和顶点分离器游戏的实例可以很容易地转化为彼此。作为这一结果的应用，这两个游戏被证明是NP完全的。
SummaryWe exhibit a close relationship between two topics in computational complexity. One topic is the analysis of storage requirements for nondeterministic computations. The corresponding mathematical model is a well known black-white pebble game on directed acyclic graphs. The other topic is the search for small separators of undirected graphs. We model a dynamic version of the concept of a separator with a vertex separator game. This game is closely related to graph layout and searching problems. We show that instances of the black-white pebble game and the vertex separator game can easily be transformed into each other. As an application of this result both games are shown to be NP-complete.