Suppose that we are given two dominating sets Ds and Dt of a graph G whose cardinalities are at most a given threshold k. Then, we are asked whether there exists a sequence of dominating sets of Gâ€¦ (More)

A graph problem P is a vertex-subset problem if feasible solutions for P consist of subsets of the vertices of a graph G. The st-connectivity problem for a vertex-subset problem P takes as input twoâ€¦ (More)