Article contents
Minimal 2-dominating sets in trees∗
Published online by Cambridge University Press: 08 July 2013
Abstract
We provide an algorithm for listing all minimal 2-dominating sets of a tree of ordern in time 𝒪(1.3248n). This implies that every tree has at most1.3248n minimal 2-dominating sets. We also show that thisbound is tight.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences 2013
References
- 3
- Cited by