Sign in
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees.
Ulrike Große
Christian Knauer
Fabian Stehn
Joachim Gudmundsson
Michiel H. M. Smid
Published in:
Int. J. Found. Comput. Sci. (2019)
Keyphrases
</>
theoretical analysis
learning algorithm
case study
computational cost
optimization problems
orders of magnitude
neural network
data structure
shortest path
computationally expensive
computer vision
website
times faster