A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.
Vladimir KolmogorovPublished in: Algorithmica (2010)
Keyphrases
- detection algorithm
- graph based algorithm
- learning algorithm
- objective function
- k means
- optimal solution
- graph structure
- tree structure
- simulated annealing
- worst case
- sequence alignment
- computational cost
- dynamic programming
- significant improvement
- np hard
- computational complexity
- clustering method
- recognition algorithm
- preprocessing
- minimum spanning tree
- homology generators
- dominating set
- graph construction
- memory efficient
- search space
- cost function
- input data
- knn
- probabilistic model