Search
Abstract
We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS
no. 47,
edition 03,
pages 235 - 240,
ISSN: 0988-3754 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Krzywkowski M.: Minimal 2-dominating sets in Trees// RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. -Vol. 47, iss. 03 (2013), s.235-240
- Verified by:
- Gdańsk University of Technology
seen 65 times