An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs.
Evaggelos LappasStavros D. NikolopoulosLeonidas PaliosPublished in: IWOCA (2009)
Keyphrases
- objective function
- detection algorithm
- improved algorithm
- k means
- times faster
- graph structure
- dynamic programming
- cost function
- computational complexity
- experimental evaluation
- search space
- simulated annealing
- expectation maximization
- theoretical analysis
- graph partitioning
- clustering method
- hyper graph
- recognition algorithm
- computationally efficient
- matching algorithm
- segmentation algorithm
- markov random field
- data structure
- optimal solution