121 citations · 369 across the 9 of their papers we have counts for
1 paper · 1 filter
T. S. Jackson, N. Read
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the…