External-Memory MST
External-Memory MST. (Arge, Brodal, Toma). Minimum-Spanning Tree. Given a weighted, undirected graph G=(V,E), the minimum-spanning tree (MST) problem is the problem of finding a spanning tree for G of minimum weight. Assumptions: G is connected; No two edges in G have the same weight.
454 views • 25 slides