A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
Serge GaspersMathieu LiedloffPublished in: WG (2006)
Keyphrases
- dominating set
- connected dominating set
- learning algorithm
- dynamic programming
- search space
- facility location problem
- detection algorithm
- k means
- matching algorithm
- probabilistic model
- computational complexity
- np hard
- graph isomorphism
- objective function
- optimal solution
- scheduling problem
- linear programming
- evolutionary algorithm
- graph structure
- weighted graph
- undirected graph
- graph construction
- genetic algorithm