Parallel Minimum Cuts : An improved CREW PRAM algorithm
This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. It has near-linear wor...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2020
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287962 |