Proof that Dominant Set of a Graph is NP-Complete - GeeksforGeeks
Domination - 演算法筆記
Minimum dominating set-based methods for analyzing biological networks - ScienceDirect
GitHub - alkapmuzeyyen/Minimum-Dominating-Set-Problem: A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.
Domination Numbers of Graphs Containing Vertex-Disjoint Cycles in Graphs
An iterated greedy algorithm for finding the minimum dominating set in graphs - ScienceDirect
Solving the k-dominating set problem on very large-scale networks | Computational Social Networks | Full Text
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Towards efficient local search for the minimum total dominating set problem | Applied Intelligence
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph - ScienceDirect
Solved a. Give an example of a dominating set of minimal | Chegg.com