📚 Practice Mode
Computer Science (UGC/NET)
Learn at your own pace with hints and detailed explanations
1 / 15
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