Login / Signup

An Algorithm for Finding K Minimum Spanning Trees.

Naoki KatohToshihide IbarakiHisashi Mine
Published in: SIAM J. Comput. (1981)
Keyphrases
  • learning algorithm
  • computational complexity
  • segmentation algorithm
  • objective function
  • np hard
  • k means
  • clustering method
  • multiscale
  • worst case
  • particle swarm optimization
  • distance metric
  • convex hull