Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. Fomin, F. V., Grandoni, F., Pyatkin, A. V., & Stepanov, A. A. In Deng, X. & Du, D., editors, ISAAC, volume 3827, of Lecture Notes in Computer Science, pages 573-582, 2005. Springer.
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [link]Link  Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [link]Paper  bibtex   
@inproceedings{conf/isaac/FominGPS05,
  author = {Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A.},
  booktitle = {ISAAC},
  crossref = {conf/isaac/2005},
  date = {2005-12-09},
  editor = {Deng, Xiaotie and Du, Ding-Zhu},
  ee = {http://dx.doi.org/10.1007/11602613_58},
  interhash = {88bf9df61ce9bf1cdcc77e2cb269ee32},
  intrahash = {9a3832a485f67e01465cf988c690c2e3},
  isbn = {3-540-30935-7},
  pages = {573-582},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.},
  url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2005.html#FominGPS05},
  volume = 3827,
  year = 2005
}

Downloads: 0