Abstract: We develop and extensively evaluate highly scalable distributed-memory algorithms for computing minimum spanning trees (MSTs). At the heart of our solutions is a scalable variant of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results