An ABC-optimized upper bound for star complexity, corrected to circuit complexity, produces a more linear relationship with information complexity on 1000 Erdős-Rényi graphs.
Complexity of Networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An improved upper bound measure of star complexity of graphs
An ABC-optimized upper bound for star complexity, corrected to circuit complexity, produces a more linear relationship with information complexity on 1000 Erdős-Rényi graphs.