The Domination Complexity and Related Extremal Values of Large 3D Torus

Procedure 1

Procedure MinDomination(, );

Input: a graph and a family of inequivalent subsets of .

begin

 minDom ←+∞;

 for all do

  compute by solving the model ILPDominatingSet with additional

  constraints that for each ;

  if () then ;

 endfor

 Solve the model ILPDominatingSet with additional constraints

 that for each in the orbit of a set and

 let be the objective value;

 return min{minDOM, };

end.