We show that the exact computation of a minimum or a maximum cut of a given graph G is out of reach for any one-pass streaming algorithm, that is, for any algorithm that runs over the input stream of G's edges only once and has a working memory of o(n 2 ) bits. This holds even if randomization is allowed.
Zelke shows that any algorithm that is able to find a minimum cut of an undirected graph requires VðmÞ bits of working memory, this remains true even if randomization is allowed REF .
Intractability of min- and max-cut in streaming graphs
Inf. Process. Lett.
Inf. Process. Lett.
Mathematics Computer Science