A matroid approach to finding edge connectivity and packing arborescences
Harold N. Gabow · 1991
Article A matroid approach to finding edge connectivity and packing arborescences Share on Author: Harold N. Gabow Univ. of Colorado at Boulder Univ. of Colorado at BoulderView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 112–122https://doi.org/10.1145/103418.103436Online:03 January 1991Publication History 57citation988DownloadsMetricsTotal Citations57Total Downloads988Last 12 Months20Last 6 weeks1 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