Pith. sign in

Large independent sets on random $d$-regular graphs with fixed degree $d$

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d \in [3,100]$. For all $d \in [5,100]$, our results are larger than lower bounds calculated by exact methods, thus providing improved estimates of lower bounds.

fields

quant-ph 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.