An incremental polynomial time algorithm to enumerate all minimal edge dominating sets

DOI10.1007/s00453-014-9875-7zbMath1330.05118MaRDI QIDQ494806

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

Publication date: 2 September 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9875-7

zbMATH Keywords

enumerations; line graphs; minimal dominating sets

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C30: Enumeration in graph theory

05D15: Transversal (matching) theory

05C85: Graph algorithms (graph-theoretic aspects)

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

05C76: Graph operations (line graphs, products, etc.)