An improved upper bound measure of star complexity of graphs

Russell K. Standish

Home/Archive/arXiv

arXiv · 2604.16327

An improved upper bound measure of star complexity of graphs

Russell K. Standish

View original source ↗Read source document ↗Export metadata ↓

Abstract

In \cite{Standish25c}, I explored the connection between star complexity and information based complexity. Because of the numerical difficulty in computing star complexity, I introduced a proxy measure that is an upper bound to star complexity, and showed a strong albeit non-linear relationship between the measures. In this paper, I introduce a tighter upper bound, by exploiting the well-known ABC package used to optimise logic circuits. In testing the new measure, I found that I had been computing the {\em formula complexity} variant of star complexity, rather than the tighter {\em circuit complexity} variant. Since Jukna clearly states the connection between star complexity and circuit complexity, I have modified the graph walking algorithm to capture circuit complexity rather than formula complexity. With this new ABC-based measure, applied to a set of 1000 500 vertex Erd\"os-Renyi graphs, a more linear relationship between star complexity and information based complexity is found.

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Russell K. Standish. 2026-03-09. An improved upper bound measure of star complexity of graphs. https://arxiv.org/abs/2604.16327

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↗