Login / Signup
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees.
Toshimitsu Masuzawa
Kenichi Hagihara
Nobuki Tokura
Published in:
Discret. Appl. Math. (1987)
Keyphrases
</>
high accuracy
dynamic programming
experimental evaluation
worst case
closed form
neural network
learning algorithm
decision trees
optimal solution
computational complexity
cost function
optimization algorithm
tree structure
globally optimal