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

DOI10.1007/978-3-642-39206-1_41zbMath1336.05133arXiv1208.5345MaRDI QIDQ5326585

Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Yngve Villanger

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5345

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)