Login / Signup

An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees.

Shaunak PawagiI. V. Ramakrishnan
Published in: Inf. Process. Lett. (1986)
Keyphrases
  • worst case
  • learning algorithm
  • k means
  • search space
  • np hard
  • simulated annealing
  • similarity measure
  • probabilistic model