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]

@article{MasuzawaHT87-0,
  title = {An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees},
  author = {Toshimitsu Masuzawa and Kenichi Hagihara and Nobuki Tokura},
  year = {1987},
  doi = {10.1016/0166-218X(87)90007-2},
  url = {http://dx.doi.org/10.1016/0166-218X(87)90007-2},
  researchr = {https://researchr.org/publication/MasuzawaHT87-0},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {17},
  number = {1-2},
  pages = {67-105},
}