Complexity of the minimum single dominating cycle problem for graph classes

Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue

Research output: Contribution to journalArticle

Abstract

In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirected graph G = (V, E) of n = |V| vertices, the goal of the Minimum Single Dominating Cycle problem (MinSDC) is to find a single shortest cycle which dominates all vertices, i.e., a cycle C such that for the set V(C) of vertices in C and the set N(V(C)) of neighbor vertices of C, V(G) = V(C) ∪ N(V(C)) and |V(C)| is minimum over all dominating cycles in G [6], [17], [24]. In this paper we consider the (in)approximability of MinSDC if input graphs are restricted to some special classes of graphs. We first show that MinSDC is still NP-hard to approximate even when restricted to planar, bipartite, chordal, or r-regular (r ≥ 3). Then, we show the (ln n + 1)-approximability and the (1 - ϵ) ln n-inapproximability of MinSDC on split graphs under P ≠ NP. Furthermore, we explicitly design a linear-time algorithm to solve MinSDC for graphs with bounded treewidth and estimate the hidden constant factor of its running time-bound.

Original languageEnglish
Pages (from-to)574-581
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE101D
Issue number3
DOIs
Publication statusPublished - Mar 1 2018

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Complexity of the minimum single dominating cycle problem for graph classes. / Eto, Hiroshi; Kawahara, Hiroyuki; Miyano, Eiji; Nonoue, Natsuki.

In: IEICE Transactions on Information and Systems, Vol. E101D, No. 3, 01.03.2018, p. 574-581.

Research output: Contribution to journalArticle

Eto, Hiroshi ; Kawahara, Hiroyuki ; Miyano, Eiji ; Nonoue, Natsuki. / Complexity of the minimum single dominating cycle problem for graph classes. In: IEICE Transactions on Information and Systems. 2018 ; Vol. E101D, No. 3. pp. 574-581.
@article{aaeafb4ead0942aba0ef1fc81e423a3b,
title = "Complexity of the minimum single dominating cycle problem for graph classes",
abstract = "In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirected graph G = (V, E) of n = |V| vertices, the goal of the Minimum Single Dominating Cycle problem (MinSDC) is to find a single shortest cycle which dominates all vertices, i.e., a cycle C such that for the set V(C) of vertices in C and the set N(V(C)) of neighbor vertices of C, V(G) = V(C) ∪ N(V(C)) and |V(C)| is minimum over all dominating cycles in G [6], [17], [24]. In this paper we consider the (in)approximability of MinSDC if input graphs are restricted to some special classes of graphs. We first show that MinSDC is still NP-hard to approximate even when restricted to planar, bipartite, chordal, or r-regular (r ≥ 3). Then, we show the (ln n + 1)-approximability and the (1 - ϵ) ln n-inapproximability of MinSDC on split graphs under P ≠ NP. Furthermore, we explicitly design a linear-time algorithm to solve MinSDC for graphs with bounded treewidth and estimate the hidden constant factor of its running time-bound.",
author = "Hiroshi Eto and Hiroyuki Kawahara and Eiji Miyano and Natsuki Nonoue",
year = "2018",
month = "3",
day = "1",
doi = "10.1587/transinf.2017FCP0007",
language = "English",
volume = "E101D",
pages = "574--581",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - Complexity of the minimum single dominating cycle problem for graph classes

AU - Eto, Hiroshi

AU - Kawahara, Hiroyuki

AU - Miyano, Eiji

AU - Nonoue, Natsuki

PY - 2018/3/1

Y1 - 2018/3/1

N2 - In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirected graph G = (V, E) of n = |V| vertices, the goal of the Minimum Single Dominating Cycle problem (MinSDC) is to find a single shortest cycle which dominates all vertices, i.e., a cycle C such that for the set V(C) of vertices in C and the set N(V(C)) of neighbor vertices of C, V(G) = V(C) ∪ N(V(C)) and |V(C)| is minimum over all dominating cycles in G [6], [17], [24]. In this paper we consider the (in)approximability of MinSDC if input graphs are restricted to some special classes of graphs. We first show that MinSDC is still NP-hard to approximate even when restricted to planar, bipartite, chordal, or r-regular (r ≥ 3). Then, we show the (ln n + 1)-approximability and the (1 - ϵ) ln n-inapproximability of MinSDC on split graphs under P ≠ NP. Furthermore, we explicitly design a linear-time algorithm to solve MinSDC for graphs with bounded treewidth and estimate the hidden constant factor of its running time-bound.

AB - In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirected graph G = (V, E) of n = |V| vertices, the goal of the Minimum Single Dominating Cycle problem (MinSDC) is to find a single shortest cycle which dominates all vertices, i.e., a cycle C such that for the set V(C) of vertices in C and the set N(V(C)) of neighbor vertices of C, V(G) = V(C) ∪ N(V(C)) and |V(C)| is minimum over all dominating cycles in G [6], [17], [24]. In this paper we consider the (in)approximability of MinSDC if input graphs are restricted to some special classes of graphs. We first show that MinSDC is still NP-hard to approximate even when restricted to planar, bipartite, chordal, or r-regular (r ≥ 3). Then, we show the (ln n + 1)-approximability and the (1 - ϵ) ln n-inapproximability of MinSDC on split graphs under P ≠ NP. Furthermore, we explicitly design a linear-time algorithm to solve MinSDC for graphs with bounded treewidth and estimate the hidden constant factor of its running time-bound.

UR - http://www.scopus.com/inward/record.url?scp=85042631622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042631622&partnerID=8YFLogxK

U2 - 10.1587/transinf.2017FCP0007

DO - 10.1587/transinf.2017FCP0007

M3 - Article

AN - SCOPUS:85042631622

VL - E101D

SP - 574

EP - 581

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -