摘要: Starting from the vertex cover problem, this paper obtains a more particular NP-complete problem (comparing with the feedback vertex set problem) and its counterpart in finite automata theory关键词: Theoretical or Mathematical/ finite automata set theory/ vertex cover NP-complete feedback ...
Starting from the vertex cover problem, this paper obtains a more particular NP-complete problem (comparing with the feedback vertex set problem) and its counterpart in finite automata theorydoi:10.1016/0020-0190(79)90144-3Dan A. Simovici
Using this method, we show that #3-Regular Bipartite Planar Vertex Cover is #P-complete. The result is unexpected, since the same question for 2-regular graph is in FP. This is part of the first author’s Ph.D. thesis. Both authors are grateful to their supervisor Prof. Angsheng Li ...
When can $t$ terminal pairs in an $m imes n$ grid be connected by $t$ vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the ``...
Chordal graph Independent domination NP-complete Weight The concept of domination in graph theory is a natural model for many location problems in operations research. In a graph G=(V,E), a dominating set is a subset D of V such that every vertex not in D is adjacent to atleast one ver...
Otherwise, a new DNA algorithm for optimal solution of a reduced NP-complete problem or a reduced NP-hard problem should be developed from the characteristic of NP-complete problems or NP-hard problems. 展开 关键词: DNA-based computing NP-complete problems NP-hard problems Vertex-cover problem ...
In this paper we show that for n-vertex graphs with maximum degree 3, and for any fixed ε> 0, it is NP-hard to find α-edge separators and α-vertex separators of size no more than OPT+n12 − ε, where OPT is the size of the optimal solutio n. For general graphs we show th...
the versatile greyhou the vertex map shader the very np the very realistic the vicissitudes of h the victim of a crime the victory also the vigil of the head the villa ariadne the villain the vills horizon the vineyard is confo the violent bear it a the violet mansion the virgin and chi...
Collapsing cliques to get a planar graph is NP-complete A graph is a (planar, Kh)-graph if a collection of disjoint clusters can be identified such that the subgraph induced by each cluster is an h-clique and co... V Batagelj,FJ Brandenburg,W Didimo,... 被引量: 0发表: 0年 The ma...
Testing whether a given graph has a k-track layout for any constant \(k\ge 3\) is NP-complete. Proof For \(k=3\) this follows from Theorem 1 and from the known NP-completeness of level planarity, proven by Heath and Rosenberg [4]. For \(k>3\) this follows by adding \(k-3\...