Computer Science, asked by shashanksai120701, 2 months 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

Environmental Sciences, 1 month ago

which is the national food of kerala...

Math, 1 month ago

Find the smallest number by which 1620 must be divided so as to get a perfect square. Also, find the square root of the perfect square. SPAMMERS STAY AWAY FULL EXPLANATION IN YOUR ATTACHMENT OF ANSWER...

Math, 1 month ago

The complement of an angle is 40 degree. what is the measure of the supplement of the angle...

Math, 2 months ago

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

CBSE BOARD XII, 2 months ago

what is advantage of regular health checkup...

Environmental Sciences, 9 months ago

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

Science, 9 months ago

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

Physics, 9 months ago

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