343 views
0 votes
0 votes
T/F

In a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to find a minimum spanning tree in G.

Also,Does this "weight w(e) such that 1<= W(e) <=n"  has significance on time complexity or we consider it as some edges weights and proceed?

1 Answer

Related questions

0 votes
0 votes
1 answer
1
Lakshman Bhaiya asked Nov 8, 2018
1,031 views
How many numbers of spanning tree are possible?
0 votes
0 votes
1 answer
2
atulcse asked Jan 13, 2022
476 views
How many minimum spanning trees are possible in this graph?
1 votes
1 votes
1 answer
3
Ram Swaroop asked Jan 30, 2019
1,561 views
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the...
0 votes
0 votes
0 answers
4