A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.
K. S. EaswarakumarC. Pandu RanganGrant A. ChestonPublished in: Inf. Process. Lett. (1994)
Keyphrases
- spanning tree
- minimum spanning tree
- graph structure
- undirected graph
- dynamic programming
- linear complexity
- detection algorithm
- minimum weight
- np hard
- objective function
- minimum spanning trees
- segmentation algorithm
- search space
- learning algorithm
- worst case
- weighted graph
- special case
- computational complexity
- optimal solution
- graph based algorithm
- edge disjoint
- expectation maximization
- knapsack problem
- graph theory
- probabilistic model
- graph model
- k means