open access

https://hdl.handle.net/2115/70952

(Total) Vector domination for graphs with bounded branchwidth

英語

Bounded branchwidth

2016-07-10

Elsevier

Discrete applied mathematics

207

80-89

Given a graph G = (V, E) of order n and an n-dimensional non-negative vector d = (d(1), d(2),..., d(n)), called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum S subset of V such that every vertex nu in V \ S (resp., in V) has at least d(nu) neighbors in S. The (total) vector domination is a generalization of many dominating set type problems, e.g., the dominating set problem, the k-tuple dominating set problem (this k is different from the solution size), and so on, and its approximability and inapproximability have been studied under this general framework. In this paper, we show that a (total) vector domination of graphs with bounded branchwidth can be solved in polynomial time. This implies that the problem is polynomially solvable also for graphs with bounded treewidth. Consequently, the (total) vector domination problem for a planar graph is subexponential fixed-parameter tractable with respect to k, where k is the size of solution. (C) 2016 Elsevier B.V. All rights reserved.

学術雑誌論文

Accepted Manuscript

Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

0166-218X