A good algorithm for edge-disjoint branching
- 30 November 1974
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 3 (2), 51-53
- https://doi.org/10.1016/0020-0190(74)90024-6
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Testing graph connectivityPublished by Association for Computing Machinery (ACM) ,1974
- Connectivity in digraphsJournal of Combinatorial Theory, Series B, 1973