W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs

Mohsen Alambardar Meybodi; Mohammad Reza Hooshmandasl; Ali Shakiba

Home/Archive/arXiv

arXiv · 2111.02025

W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs

Mohsen Alambardar Meybodi·Mohammad Reza Hooshmandasl·Ali Shakiba

View original source ↗Read source document ↗Export metadata ↓

Abstract

A set $D \subseteq V$ of a graph $G = (V,E)$ is called an outer-connected dominating set of $G$ if every vertex $v$ not in $D$ is adjacent to at least one vertex in $D$, and the induced subgraph of $G$ on $V \setminus D$ is connected. The Minimum Outer-connected Domination problem is to find an outer-connected dominating set of minimum cardinality for the input graph $G$. Given a positive integer $k$ and a graph $G = (V, E)$, the Outer-connected Domination Decision problem is to decide whether $G$ has an outer-connected dominating set of cardinality at most $k$. The Outer-connected Domination Decision problem is known to be NP-complete, even for bipartite graphs. We study the problem of outer-connected domination on sparse graphs from the perspective of parameterized complexity and show that it is W[1]-hard on d-degenerate graphs, while the original connected dominating set has FTP algorithm on d-degenerate graphs.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba. 2021-11-03. W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs. https://arxiv.org/abs/2111.02025

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗