edges contains self loops figure successful run karger 's algorithm vertex graph minimum cut size indicated vertex colours figure contraction vertex b karger 's basic algorithm '''begin''' '' 'repeat''' '' 'repeat''' take random edge uv e g replace u v contraction u' '''until''' nodes remain obtain corresponding cut result c sub sub '''until''' output minimum cut among c sub sub c sub sub c sub sub '''end''' execution outer
Formal science Computer science Algorithms Randomized algorithms