An Õ(n 2 ) algorithm for minimum cuts
David R. Karger, Clifford Stein · 1993
Article An Õ(n2) algorithm for minimum cuts Share on Authors: David R. Karger View Profile , Clifford Stein View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 757–765https://doi.org/10.1145/167088.167281Online:01 June 1993Publication History 35citation853DownloadsMetricsTotal Citations35Total Downloads853Last 12 Months22Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access