Experimental Study of Minimum Cut Algorithms
| dc.contributor.advisor | Karger, David R. | en_US |
| dc.contributor.author | Levine, Matthew S. | en_US |
| dc.date.accessioned | 2023-03-29T15:29:13Z | |
| dc.date.available | 2023-03-29T15:29:13Z | |
| dc.date.issued | 1997-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149850 | |
| dc.description.abstract | Recently, several new algorithms have been developed for the minimum cut problem that substantially improve worst-case time bounds for the problem. These algorithms are very different from the earlier ones and from each other. We conduct an experimental | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-719 | |
| dc.title | Experimental Study of Minimum Cut Algorithms | en_US |
