{"version":"1.0","type":"link","title":"Karger's algorithm - Newikis","description":"In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. It was invented by David Karger and first published in 1993.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/c/c0/Min_cut_example.svg/1280px-Min_cut_example.svg.png","thumbnail_width":1280,"thumbnail_height":995}