Computer Sciences > GATE 2026 SET-2 > Algorithms
Consider a complete graph πΎπ with π vertices (π>4). Note that multiple spanning
trees can be constructed over πΎπ. Each of these spanning trees is represented as a
set of edges. The Jaccard coefficient between any two sets is defined as the ratio of
the size of the intersection of the two sets to the size of the union of the two sets.
Which one of the following options gives the lowest possible value for the Jaccard
coefficient between any two spanning trees of πΎπ ?
Correct : c
Similar Questions
Match the following
(P) Primβs algorithm for minimum spanning tree
(i) Backtracking
(Q) Floyd-Warshall algorithm fo...
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Consider functions Function 1 and Function 2 expressed in pseudocode as follows:
Let f1(n) and f2(n) denote the number of times the statement "x = x + 1" is...
Total Unique Visitors
Loading......