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

DOI10.1016/0166-218X(87)90007-2zbMath0616.05045OpenAlexW1991573073MaRDI QIDQ1821118

Ken'ichi Hagihara, Nobuki Tokura, Toshimitsu Masuzawa

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90007-2

zbMATH Keywords

rooted treesrooted directed treesaugmentation problemk-vertex-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (3)

Augmenting trees so that every three vertices lie on a cycle ⋮ An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees
• Approximation Algorithms for Several Graph Augmentation Problems
• Augmentation Problems

This page was built for publication: An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees