Structurally parameterized d-scattered set

Structurally Parameterized $d$-Scattered Set

In d-Scattered Set we are given an (edge-weighted) graph and are asked to select at least k vertices, so that the distance between any pair is at least d, thus generalizing Independent Set. We provide upper and lower bounds on the complexity of this problem with respect to various standard graph parameters. In particular, we show the following: • For any d ≥ 2, an O∗(dtw)-time algorithm, where ...

Parameterized Algorithms for d-Hitting Set: the Weighted Case

We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1

Parameterized Planar Dominating Set

Parameterized Planar Dominating Set 21

New parameterized algorithms for edge dominating set

An edge dominating set of a graph G = (V,E) is a subset M ⊆ E of edges in the graph such that each edge in E −M is incident with at least one edge in M . In an instance of the parameterized edge dominating set problem we are given a graph G = (V,E) and an integer k and we are asked to decide whether G has an edge dominating set of size at most k. In this paper we show that the parameterized edg...