Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.
B. S. PandaArti PandeyPublished in: WALCOM (2014)
Keyphrases
- dominating set
- computational complexity
- learning algorithm
- connected dominating set
- objective function
- np hard
- dynamic programming
- worst case
- expectation maximization
- detection algorithm
- optimal solution
- k means
- cost function
- mathematical model
- facility location problem
- simulated annealing
- combinatorial optimization
- graph model
- undirected graph
- genetic algorithm