An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
Akiyoshi ShiouraAkihisa TamuraTakeaki UnoPublished in: SIAM J. Comput. (1997)
Keyphrases
- spanning tree
- undirected graph
- dynamic programming
- optimal solution
- worst case
- search space
- probabilistic model
- edge disjoint
- minimum spanning tree
- np hard
- expectation maximization
- graph structure
- upper bound
- objective function
- bayesian framework
- approximation algorithms
- times faster
- minimum cost
- image processing
- lower bound