An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs.
Shin-ichi NakayamaShigeru MasuyamaPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2003)
Keyphrases
- spanning tree
- detection algorithm
- undirected graph
- dynamic programming
- np hard
- objective function
- expectation maximization
- minimum length
- minimum spanning tree
- learning algorithm
- probabilistic model
- hamiltonian cycle
- matching algorithm
- segmentation algorithm
- preprocessing
- computational complexity
- search space
- random graphs
- subgraph isomorphism
- minimum weight
- attributed graphs
- worst case
- k means
- square error