Minimal 2-dominating sets in trees

Minimal 2-dominating sets in trees

We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:RAIRO. Informatique théorique et applications 2013-07, Vol.47 (3), p.235-240
1. Verfasser: Krzywkowski, Marcin
Format: Artikel
Sprache:eng
Schlagworte:
05C05
05C69
05C85
2-domination
68R10
68W05
counting
Domination
exact exponential algorithm
listing algorithm
minimal 2-dominating set
tree
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n). This implies that every tree has at most 1.3248n minimal 2-dominating sets. We also show that this bound is tight.
ISSN:0988-3754
1290-385X
DOI:10.1051/ita/2013036