We present an algorithm to solve the Maximum Leaf Spanning Tree problem from an exponential time viewpoint, where it is equivalent to the Connected Dominating Set problem.Expand

The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k leaves in a given digraph.Expand

The Power Dominating Set problem is a variant of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum P⊆V such that all vertices in V are “observed” by P. Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed.Expand

We present an algorithm yielding a run time upper bound of ${\mathcal{O}}^*({2^{\frac{K}{6.2158}}})$ for Max-2-Sat (each clause contains at most 2 literals), where every formula is constrained to have at most two literals.Expand

Abstract
The NP-complete Power Dominating Set problem is an “electric power networks variant” of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum-size set… Expand

The k-Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented spanning tree, with at least k leaves in a given digraph.Expand

We study the Maximum Leaf Spanning Tree problem from an exact exponential time point of view, where it is equivalent to the Connected Dominating Set problem.Expand