![Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text](https://media.springernature.com/lw685/springer-static/image/art%3A10.1186%2Fs40649-020-00078-5/MediaObjects/40649_2020_78_Figc_HTML.png)
Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text
![Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S0304397517302037-gr003.gif)
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect
![Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S0304397517302037-gr008.gif)
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect
![PDF] A Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems | Semantic Scholar PDF] A Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/f1066c8d1a1141cfda07a1be9279d1ba25ac7a72/5-Figure1-1.png)