For sparse graphs, our cycle-based approach is also more time efficient than the vertex-based. As an additional contribution of this work, we present an effective algorithm to compute the minimum ...

and logistical problems—to computer science, which some define as the study of algorithms. The particular algorithm presented here as Construction A, now known as Kruskal's algorithm, finds the ...