An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Golovach, P. & Heggernes, P. In Fomin, F. V., Freivalds, R., Kwiatkowska, M., & Peleg, D., editors, ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming, volume 7965, of Lecture Notes in Computer Science, pages 485--496, Riga, Latvia, July, 2013. Springer Berlin Heidelberg.
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets [link]Paper  doi  bibtex   
@inproceedings{ Golovach2013a,
  address = {Riga, Latvia},
  author = {Golovach, PA and Heggernes, Pinar},
  booktitle = {ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming},
  doi = {10.1007/978-3-642-39206-1_41},
  editor = {Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David},
  file = {:Users/KunihiroWASA/Dropbox/paper/2013/Golovach, Heggernes, An incremental polynomial time algorithm to enumerate all minimal edge dominating sets, 2013.pdf:pdf},
  month = {July},
  pages = {485--496},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{An incremental polynomial time algorithm to enumerate all minimal edge dominating sets}},
  url = {http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41},
  volume = {7965},
  year = {2013}
}

Downloads: 0