I need a fast min-dominating-set code for some complexity lower bounds research I am doing.
I could transform to SAT and use an off the shelf SAT solver; but I was hoping min-dom-set had something out there comparable to Cliquer for max-clique.
--Update-- Currently using Z3 SMT Optimize Python bindings subject to minimizing sum of dominating vertices. 0 = default, 1 = dominating. Sum of vertex and neighborhood must be >= 1 for each vertex. Here is the source code.