Computer Science (UGC/NET)
Casual Mode - Take your time!
1 / 15
Correct
0
Incorrect
0
Score
0%
Multiple Choice
Which of the following problems is not considered to be in NP-complete?
- dominating set problem
- vertex cover decision problem
- Hamiltonian path problem
- subset sum problem
- graph isomorphism