Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality

DOI10.4230/LIPIcs.IPEC.2015.307zbMath1378.05199OpenAlexW2293091812MaRDI QIDQ5363784

Dieter Kratsch, Pinar Heggernes, Petr A. Golovach

Publication date: 29 September 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.307

zbMATH Keywords

enumerationexact algorithmsminimal connected dominating set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality