Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs.
Yacine BelhoulSaïd YahiaouiHamamache KheddouciPublished in: Inf. Process. Lett. (2014)
Keyphrases
- graph theory
- computationally intensive
- computationally efficient
- orders of magnitude
- efficient implementation
- significant improvement
- highly scalable
- data structure
- representational power
- benchmark datasets
- computationally expensive
- graph properties
- data sets
- highly efficient
- directed graph
- machine learning algorithms
- data mining techniques
- association rules
- optimal solution