Cache Oblivious Minimum Cut.

We show how to compute the minimum cut of a graph cache-efficiently. Let B be the width of a cache line and M be the size of the cache. On a graph with V vertices and E edges, we give a cache oblivious algorithm that incurs O(⌈E/B (log ^4 E) log _M/B E⌉ ) cache misses and a simpler one that incurs O(⌈V^2/Blog ^3 V⌉ ) cache misses.