Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting

S. Shine, K. Murali Krishnan

A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-fl…