a) Hamiltonian cycle
b) Travelling salesman problem
c) Calculating chromatic number of graph
d) Finding maximum element in an array
Which of the following is an NP complete problem?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following is an NP complete problem?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!