One easy (but admittedly ad-hoc) trick is to instead use an approximate minimum spanning tree by building a graph only over the $k$ nearest neighbors.  For most datasets, given a reasonable choice of $k$, the result is likely to be the same as in the exact case.