Skip to main content
Conference Proceedings

Minimal double dominating sets in trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8497 LNCS 151-157
DOI: 10.1007/978-3-319-08016-1_14
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Author supplied keywords

Cite

CITATION STYLE

APA

Krzywkowski, M. (2014). Minimal double dominating sets in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8497 LNCS, pp. 151–157). Springer Verlag. https://doi.org/10.1007/978-3-319-08016-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free