arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.12293cs.DS
收藏

固定度随机$d$ -正则图$d$的大独立集

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

Raffaele Marino, Scott Kirkpatrick

摘要:

本文提出了一种线性优先局部算法,用于计算随机$d$ -正则小度固定度图$d$上的大独立集。实验研究了该算法在$ d \in [3,100]$ .对于所有的$d \in [5,100]$,我们的结果是大于精确方法计算的下限,从而提供了改进的估计下限。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑