Log In

Answers by Tejasvi96

3 votes
answered Oct 28, 2018 in Databases 593 views
2 votes
Suppose that average edge weight for a graph G is Aavg. Then the minimum spanning tree of G will have weight at most (n-1) Aavg. Where n is number of vertices in graph G. i think think is false but in a solution mannul it is given as true please check it.
answered Jun 16, 2018 in Algorithms 198 views