Efficiency in exponential time for domination-type problems Original Research Article

We design fast exponential time algorithms for some intractable graph-theoretic problems. Our main result states that a minimum optional dominating set in a graph of order image can be found in time image. Our methods to obtain this result involve matching techniques.