HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
経済学研究科  >
雑誌発表論文等  >

(Total) Vector domination for graphs with bounded branchwidth

この資料はクリエイティブ・コモンズ・ライセンスの下で公開されています。

フルテキスト
DAM-r002b.pdf214.71 kBPDF見る/開く
この文献へのリンクには次のURLを使用してください:http://hdl.handle.net/2115/70952

タイトル: (Total) Vector domination for graphs with bounded branchwidth
著者: Ishii, Toshimasa 著作を一覧する
Ono, Hirotaka 著作を一覧する
Uno, Yushi 著作を一覧する
キーワード: Vector dominating set
Total vector dominating set
Multiple dominating set
FPT
Bounded branchwidth
発行日: 2016年 7月10日
出版者: Elsevier
誌名: Discrete applied mathematics
巻: 207
開始ページ: 80
終了ページ: 89
出版社 DOI: 10.1016/j.dam.2016.03.002
抄録: 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.
Relation (URI): https://doi.org/10.1016/j.dam.2016.03.002
資料タイプ: article (author version)
URI: http://hdl.handle.net/2115/70952
出現コレクション:雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

提供者: 石井 利昌

 

本サイトに関するご意見・お問い合わせは repo at lib.hokudai.ac.jp へお願いします。 - 北海道大学