Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.
Brahim NeggaziNabil GuellatiMohammed HaddadHamamache KheddouciPublished in: Int. J. Found. Comput. Sci. (2015)
Keyphrases
- single pass
- preprocessing
- search space
- k means
- dynamic programming
- computational cost
- learning algorithm
- similarity measure
- computational complexity
- times faster
- detection algorithm
- probabilistic model
- computationally efficient
- cost function
- high accuracy
- optimization algorithm
- optimal solution
- graph isomorphism
- worst case
- particle swarm optimization
- genetic algorithm
- np hard
- graph structure
- minimum spanning tree
- graph search