# On directed covering and domination problems

Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono

1 被引用数 (Scopus)

## 抄録

In this paper, we study covering and domination problems on directed graphs. Although undirected Vertex Cover and Edge Dominating Set are well studied classical graph problems, the directed versions have not been studied much due to the lack of clear definitions. We give natural definitions for Directed r-In (Out) Vertex Cover and Directed (p, q)- Edge Dominating Set as directed generations of Vertex Cover and Edge Dominating Set. For these problems, we show that (1) Directed r-In (Out) Vertex Cover and Directed (p, q)-Edge Dominating Set are NP-complete on planar directed acyclic graphs except when r = 1 or (p, q) = (0, 0), (2) if r 2, Directed r-In (Out) Vertex Cover is W[2] hard and c ln k-inapproximable on directed acyclic graphs, (3) if either p or q is greater than 1, Directed (p, q)-Edge Dominating Set is W[2]-hard and c ln k-inapproximable on directed acyclic graphs, (4) all problems can be solved in polynomial time on trees, and (5) Directed (0, 1), (1, 0), (1, 1)-Edge Dominating Set are fixed-parameter tractable in general graphs. The first result implies that (directed) r-Dominating Set on directed line graphs is NPcomplete even if r = 1.

本文言語 英語 28th International Symposium on Algorithms and Computation, ISAAC 2017 Takeshi Tokuyama, Yoshio Okamoto Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing 9783959770545 https://doi.org/10.4230/LIPIcs.ISAAC.2017.45 出版済み - 12月 1 2017 28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, タイ継続期間: 12月 9 2017 → 12月 22 2017

### 出版物シリーズ

名前 Leibniz International Proceedings in Informatics, LIPIcs 92 1868-8969

### その他

その他 28th International Symposium on Algorithms and Computation, ISAAC 2017 タイ Phuket 12/9/17 → 12/22/17

• ソフトウェア

## フィンガープリント

「On directed covering and domination problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。