Solved

Let SHAM3 Be the Problem of Finding a Hamiltonian Cycle

Question 1

Multiple Choice

Let SHAM3 be the problem of finding a Hamiltonian cycle in a graph G =(V,E) with V divisible by 3 and DHAM3 be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?


A) Both DHAM3 and SHAM3 are NP-hard
B) SHAM3 is NP-hard, but DHAM3 is not
C) DHAM3 is NP-hard, but SHAM3 is not
D) Neither DHAM3 nor SHAM3 is NP-hard

Correct Answer:

verifed

Verified

Related Questions

Q2: S -> aSa| bSb| a| b ;

Q3: Consider the languages: L<sub>1</sub> ={a^n b^n c^m

Q4: Consider the languagesL<sub>1</sub>={0^{i}1^{j}|i != j},L<sub>2</sub>={0^{i}1^{j}|i = j},L<sub>3</sub>

Q5: Let L<sub>1</sub> be a recursive language. Let

Q6: A minimum state deterministic finite automation accepting

Q7: If s is a string over (0

Q8: Consider the following two problems on undirected

Q9: Consider the set of strings on

Q10: For S € (0+1)* let d(s)denote the

Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}