A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph.
Pentti A. HonkanenPublished in: ACM-SE (1977)
Keyphrases
- learning algorithm
- times faster
- computational complexity
- graph structure
- detection algorithm
- dynamic programming
- search space
- cost function
- experimental evaluation
- worst case
- optimization algorithm
- optimal solution
- graph based algorithm
- maximum flow
- depth first search
- breadth first search
- high accuracy
- clustering method
- minimum spanning tree
- graph model
- graph connectivity
- tree structure
- probabilistic model
- k means
- lower bound
- preprocessing
- bayesian networks
- similarity measure