Login / Signup

Efficient determination of the k most vital edges for the minimum spanning tree problem.

Cristina BazganSonia ToubalineDaniel Vanderpooten
Published in: Comput. Oper. Res. (2012)
Keyphrases
  • real time
  • data mining
  • information retrieval
  • clustering algorithm
  • multiresolution
  • cost effective
  • computationally expensive
  • directed acyclic graph