Mendeley出力
＜会議発表論文＞
On Directed Covering and Domination Problems
| 作成者 | |
|---|---|
| 本文言語 | |
| 出版者 | |
| 発行日 | |
| 収録物名 | |
| 巻 | |
| 開始ページ | |
| 終了ページ | |
| 会議情報 | |
| 出版タイプ | |
| アクセス権 | |
| 権利関係 | |
| 権利関係 | |
| 関連DOI | |
| 関連DOI | |
| 関連URI | |
| 関連HDL | |
| 関連ISBN | |
| 関連HDL | |
| 関連情報 | |
| 概要 | 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 h...ave 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 NP-complete even if r=1.続きを見る |
詳細
| EISSN | |
|---|---|
| レコードID | |
| 関連ISBN | |
| 主題 | |
| 注記 | |
| 助成情報 | |
| 登録日 | 2025.04.23 |
| 更新日 | 2025.04.28 |