An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees

Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura. An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees. Discrete Applied Mathematics, 17(1-2):67-105, 1987. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.