The minimum augmentation of a directed tree to a k‐edge‐connected directed graph
- 1 June 1986
- Vol. 16 (2), 181-197
- https://doi.org/10.1002/net.3230160207
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Augmentation ProblemsSIAM Journal on Computing, 1976