Computer Science, asked by shashanksai120701, 5 hours ago

what is the complexity of travelling salesman problem when the graph is represented as adjacency matrix of n vertices

Answers

Answered by shrabanti48

0

Answer:

75347-%'-(::uyedvnm,n️

Previous Question

Next Question

Similar questions

Hindi, 3 hours ago

पिता ने स्वामी को देर से विद्यालय जाने को क्यों कहा?

Math, 3 hours ago

prime factories of thirty six in vertical methodब्रांड फैक्ट्री इन वॉटर ...

English, 3 hours ago

1.Don't let your sister play with a bad child 2. I Find the question very difficult...

Math, 5 hours ago

what is the formula for (a-b)^2?

CBSE BOARD XII, 5 hours ago

what is advantage of regular health checkup...

Environmental Sciences, 7 months ago

Draw a digram that shows the relationship between the biotic and the abiotic components of the environment...

Science, 7 months ago

Hills of sand that keep shifting because of strong wind are known as...

Physics, 7 months ago

Value of 96^1/2 according to binomial theorem...