A polynomial-time algorithm for the paired-domination problem on permutation graphs.
T. C. Edwin ChengLiying KangErfang ShanPublished in: Discret. Appl. Math. (2009)
Keyphrases
- computational complexity
- worst case
- learning algorithm
- cost function
- particle swarm optimization
- linear programming
- segmentation algorithm
- optimization algorithm
- detection algorithm
- spanning tree
- optimal solution
- preprocessing
- k means
- recognition algorithm
- graph isomorphism
- adjacency graph
- strongly polynomial
- minimum spanning tree
- graph structure
- graph theory
- simulated annealing
- probabilistic model
- experimental evaluation
- objective function