简单的说,构造好这样的图后,我们想要给每个三角形赋值, 每条边是 冲突的,例如我们选择第一个三角形的y为真值后,与y相连的各个顶点将不能被选择。 加入了3m个点,3m+k条边所以是多项式的时间内完成的规约。 2.Vertex Cover <=Independent Set 9. Independent Set <= Clique problem 3. 证明一...
It is an analogue of the celebrated crown decomposition which has been used for Vertex Cover. We develop the graph structure theory around such decompositions and develop fixed-parameter tractable algorithms to find them, parameterized by the number of vertices for which they witness presence in an...
A. 2003. Pushdown-reduce: An algorithm for connectivity augmentation and poset cover- ing problems. Discrete Appl. Math. 129, 2-3, 233-262.A. A. Benczu´r, "Pushdown-reduce: an algorithm for connectivity augmentation and poset cover- ing problems", In Discrete Applied Mathematics, 129(2...