I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs

The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Ω((E/V)Sort(V)) on the number of I/Os is shown for the problem, where V is the number of vertices and E is the number of edges. Then the following are presented,...

Ausführliche Beschreibung