An O(n)-time algorithm for the paired domination problem on permutation graphs.
Evaggelos LappasStavros D. NikolopoulosLeonidas PaliosPublished in: Eur. J. Comb. (2013)
Keyphrases
- knn
- experimental evaluation
- preprocessing
- improved algorithm
- high accuracy
- detection algorithm
- np hard
- learning algorithm
- optimization algorithm
- times faster
- simulated annealing
- dynamic programming
- graph structure
- k means
- search space
- computational cost
- clustering method
- graph theory
- recognition algorithm
- graph model
- graph matching
- undirected graph
- tree structure
- expectation maximization
- worst case
- cost function
- significant improvement
- computational complexity
- similarity measure