A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph.
Gongbing HongPradip K. SrimaniPublished in: ACM Southeast Regional Conference (2011)
Keyphrases
- detection algorithm
- dynamic programming
- experimental evaluation
- optimal solution
- computational complexity
- graph structure
- high accuracy
- np hard
- linear programming
- maximum flow
- minimum spanning tree
- spanning tree
- times faster
- expectation maximization
- simulated annealing
- worst case
- k means
- search space
- probabilistic model
- computational cost
- segmentation algorithm
- significant improvement
- tree structure
- convergence rate
- graph model
- preprocessing
- objective function
- similarity measure