| Issue |
RAIRO-Theor. Inf. Appl.
Volume 47, Number 3, July-August 2013
|
|
|---|---|---|
| Page(s) | 235 - 240 | |
| Section | Articles | |
| DOI | https://doi.org/10.1051/ita/2013036 | |
| Published online | 08 July 2013 | |
Minimal 2-dominating sets in trees∗
Faculty of Electronics, Telecommunications and Informatics, Gdańsk University
of Technology, Narutowicza 11/12, 80–233 Gdańsk, Poland.
marcin.krzywkowski@gmail.com
Received:
7
May
2012
Accepted:
30
April
2013
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time 𝒪(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
Mathematics Subject Classification: 05C05 / 05C69 / 05C85 / 68R10 / 68W05
Key words: Domination / 2-domination / minimal 2-dominating set / tree / counting / exact exponential algorithm / listing algorithm
© EDP Sciences 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.