Harold N. Gabow. A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, 6-8 May 1991, New Orleans, Louisiana, USA. pages 112-122, ACM, 1991.
Abstract is missing.