Computer Science, asked by shashanksai120701, 1 month 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, 16 days ago

Rajma Reddish brown С c Smooth 2 Think • Did you keep aniseed (saun/) and cumin (jeera list? • Which was the smallest seed and which was th seed in your collection? Make lists of: • Seeds that are used as spices in your home. • Seeds of vegetables...

History, 16 days ago

राधा (खेल +क्तवा) गृह गच्छति!

Math, 16 days ago

find the value of (-5/4)-1...

Math, 1 month ago

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

CBSE BOARD XII, 1 month ago

what is advantage of regular health checkup...

Environmental Sciences, 8 months ago

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

Science, 8 months ago

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

Physics, 8 months ago

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