Title of article
Efficiency in exponential time for domination-type problems Original Research Article
Author/Authors
Ingo Schiermeyer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
3291
To page
3297
Abstract
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.
Keywords
Domination , Exact algorithms , Matching technique
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886911
Link To Document