Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.
Christophe CrespelleChristophe PaulPublished in: Algorithmica (2010)
Keyphrases
- recognition algorithm
- objective function
- optimization algorithm
- detection algorithm
- expectation maximization
- probabilistic model
- tree structure
- clustering method
- pattern recognition
- k means
- significant improvement
- np hard
- worst case
- dynamic programming
- graph structure
- graph model
- spanning tree
- similarity measure
- learning algorithm
- decomposition algorithm
- graph matching
- minimum spanning tree
- genetic algorithm
- segmentation algorithm
- dynamic environments
- particle swarm optimization
- simulated annealing
- preprocessing
- video sequences
- optimal solution