NP-completeness and APX-completeness of restrained domination in graphs
نویسندگان
چکیده
منابع مشابه
Completeness in approximation classes beyond APX
We present a reduction that allows us to establish completeness results for several approximation classes mainly beyond APX. Using it, we extend one of the basic results of S. Khanna, R. Motwani, M. Sudan, and U. Vazirani (On syntactic versus computational views of approximability, SIAM J. Comput., 28:164–191, 1998) by proving the existence of complete problems for the whole Log-APX, the class ...
متن کاملContractibility and NP-completeness
For a fixed graph H, let H-CON denote the problem of determining whether a given graph is contractible to H. The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4. In particular, H-CON is NP-complete if H is a connected triangle-free graph other than a star. For each connected graph H of order a t most 4 other ...
متن کاملBroadcasting and NP - completeness
In this note, we answer two questions arising in broadcasting problems in networks. We rst describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness of nding disjoint spanning trees of minimum depth, rooted at a given vertex.
متن کاملIntroduction to Np-completeness
We use time-bounded (deterministic and nondeterministic) Turing machines to study computational complexity of decision problems. In this model, a Turing machine has two different halting states, called the accepting state and the rejecting state, respectively. We say that a Turing machine M is bounded by time T if for any input x, M on x always halts in T (|x|) moves (steps). If M is determinis...
متن کاملNP Completeness , Part 2
Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.005