Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.19102

The Computational Complexity of Factored Graphs

Shreya Gupta·Boyang Huang·Russell Impagliazzo·Stanley Woo·Christopher Ye
View original source ↗Read source document ↗Export metadata ↓

Abstract

While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct representation. An efficient algorithm (with respect to the compressed input size) could then lead to more efficient computations than algorithms taking the explicit, uncompressed object as input. This leads to a natural question: when does knowing the input instance has a more succinct representation make computation easier? We initiate the study of the computational complexity of problems on factored graphs: graphs that are given as a formula of products and unions on smaller graphs. For any graph problem, we define a parameterized version that takes factored graphs as input, parameterized by the number of (smaller) ordinary graphs used to construct the factored graph. In this setting, we characterize the parameterized complexity of several natural graph problems, exhibiting a variety of complexities. We show that a decision version of lexicographically first maximal independent set is $\mathbf{XP}$-complete, and therefore unconditionally not fixed-parameter tractable ($\mathbf{FPT}$). On the other hand, we show that clique counting is $\mathbf{FPT}$. Finally, we show that reachability is $\mathbf{XNL}$-complete. Moreover, $\mathbf{XNL}$ is contained in $\mathbf{FPT}$ if and only if $\mathbf{NL}$ is contained in some fixed polynomial time.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Shreya Gupta, Boyang Huang, Russell Impagliazzo, Stanley Woo, Christopher Ye. 2024-07-26. The Computational Complexity of Factored Graphs. https://arxiv.org/abs/2407.19102

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↗