retagged by
17,327 views
37 votes
37 votes
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
retagged by

10 Answers

–1 votes
–1 votes
ANSWER SHOULD BE O(V+E).

Related questions

10 votes
10 votes
1 answer
1
Kathleen asked Sep 12, 2014
5,447 views
Maximum number of edges in a planar graph with $n$ vertices is _____
7 votes
7 votes
3 answers
2
Kathleen asked Sep 12, 2014
1,542 views
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
11 votes
11 votes
1 answer
3
Kathleen asked Sep 12, 2014
3,108 views
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the ...
7 votes
7 votes
4 answers
4
Kathleen asked Sep 12, 2014
3,031 views
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________