Dominating set algorithms
Procs
proc dominationNumber[N](g: Graph[N]): int
- Return the domination number (size of a minimum dominating set). Uses greedy approximation.
func isDominatingSet[N](g: Graph[N]; nodes: HashSet[N]): bool
- Check if the given node set is a dominating set. Every node is either in the set or adjacent to a node in the set.
proc minimumDominatingSet[N](g: Graph[N]): HashSet[N]
- Greedy approximation for minimum dominating set. Iteratively picks the node that dominates the most uncovered nodes.