121 citations · 369 across the 9 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cond-mat.dis-nn2009★ 22 cited
Theory of minimum spanning trees II: exact graphical methods and perturbation expansion at the percolation threshold
T. S. Jackson, N. Read
Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it…
cond-mat.stat-mech2009★ 53 cited
Theory of minimum spanning trees I: Mean-field theory and strongly disordered spin-glass model
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…