Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic.
Christian LaforestRaksmey PhanPublished in: RAIRO Oper. Res. (2013)
Keyphrases
- greedy heuristic
- np hard
- matching algorithm
- initial set
- cost function
- set cover
- dynamic programming
- input data
- expectation maximization
- detection algorithm
- undirected graph
- polynomial time complexity
- np complete
- minimum length
- greedy algorithm
- minimum cost
- objective function
- search space
- worst case analysis
- spanning tree
- attributed graphs
- convex hull
- preprocessing
- worst case
- error tolerance
- minimum weight
- graph isomorphism
- solution space
- graph construction
- random graphs
- minimum spanning tree
- packing problem
- exact solution
- convergence rate
- combinatorial optimization
- particle swarm optimization
- probabilistic model
- computational complexity