Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.
Bhawani Sankar PandaArti PandeyPublished in: J. Graph Algorithms Appl. (2014)
Keyphrases
- computational complexity
- learning algorithm
- detection algorithm
- preprocessing
- dominating set
- optimal solution
- worst case
- objective function
- k means
- np hard
- probabilistic model
- simulated annealing
- phase transition
- matching algorithm
- segmentation algorithm
- graph isomorphism
- adjacency graph
- connected dominating set
- dynamic programming
- cost function
- similarity measure
- np complete
- linear programming
- lower and upper bounds
- search algorithm