Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.14553

Reducibility among NP-Hard graph problems and boundary classes

Syed Mujtaba Hassan·Shahid Hussain·Abdul Samad
View original source ↗Read source document ↗Export metadata ↓

Abstract

Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when does a hard problem become easy? What is the minimum substructure for which the problem remains hard? We use the notion of boundary classes to study such questions. In this paper, we introduce a method for transforming the boundary class of one NP-hard graph problem into a boundary class for another problem. If {\Pi} and {\Gamma} are two NP-hard graph problems where {\Pi} is reducible to {\Gamma}, we transform a boundary class of {\Pi} into a boundary class of {\Gamma}. More formally if {\Pi} is reducible to {\Gamma}, where the reduction satisfies certain conditions, then X is a boundary class of {\Pi} if and only if the image of X under the reduction is a boundary class of {\Gamma}. This gives us a relationship between boundary classes and reducibility among several NP-hard problems. To show the strength of our main result, we apply our theorem to obtain some previously unknown boundary classes for a few graph problems namely; vertex-cover, clique, traveling-salesperson, bounded-degree-spanning-tree, subgraph-isomorphism and clique-cover.

Explore related subjects

cs.CCcs.CLcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Syed Mujtaba Hassan, Shahid Hussain, Abdul Samad. 2024-11-21. Reducibility among NP-Hard graph problems and boundary classes. https://arxiv.org/abs/2411.14553

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

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↗