An algorithm for listing all minimal double dominating sets of a tree - Publication - Bridge of Knowledge

Search

An algorithm for listing all minimal double dominating sets of a tree

Abstract

We provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound 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:
FUNDAMENTA INFORMATICAE no. 130, pages 415 - 421,
ISSN: 0169-2968
Language:
English
Publication year:
2014
Bibliographic description:
Krzywkowski M.: An algorithm for listing all minimal double dominating sets of a tree// FUNDAMENTA INFORMATICAE. -Vol. 130, nr. 4 (2014), s.415-421
Verified by:
Gdańsk University of Technology

seen 66 times

Recommended for you

Meta Tags