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.
@inproceedings{Gabow91:0,
title = {A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
author = {Harold N. Gabow},
year = {1991},
tags = {systematic-approach},
researchr = {https://researchr.org/publication/Gabow91%3A0},
cites = {0},
citedby = {0},
pages = {112-122},
booktitle = {Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, 6-8 May 1991, New Orleans, Louisiana, USA},
publisher = {ACM},
}