An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger. An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica, 72(3):836-859, 2015. [doi]

@article{GolovachHKV15,
  title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets},
  author = {Petr A. Golovach and Pinar Heggernes and Dieter Kratsch and Yngve Villanger},
  year = {2015},
  doi = {10.1007/s00453-014-9875-7},
  url = {http://dx.doi.org/10.1007/s00453-014-9875-7},
  researchr = {https://researchr.org/publication/GolovachHKV15},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {72},
  number = {3},
  pages = {836-859},
}