arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.04148math.CO
收藏

度序列的有效计数

Efficient Counting of Degree Sequences

Kai Wang

摘要:

提出了一种新的动态规划算法,用于精确计算长度为$n$的零自由度序列集$D(n)$、$n$顶点上连通图的度序列集$D_c(n)$和$n$顶点上双连通图的度序列集$D_b(n)$.他们都是基于巴恩斯和萨维奇的复发,并在多项式时间内运行,渐近速度比以前最知名的算法,这些问题。这些似乎是第一个多项式时间算法来计算$|D(n)|$,$|D_c(n)|$和$|D_b(n)|$的作者的知识,并使我们能够将它们列表到$n=118$,其中大部分是未知的。现有的$|D(n)|$的数值结果倾向于给Gordon F. Royle关于$|D(n)|/|D(n-1)|$的极限。本文算法可计算的OEIS条目有A004251、A007721、A007722和A095268。

英文摘要:

Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected graphs on $n$ vertices exactly are presented. They are all based on a recurrence of Barnes and Savage and shown to run in polynomial time and are asymptotically much faster than the previous best known algorithms for these problems. These appear to be the first polynomial time algorithms to compute $|D(n)|$, $|D_c(n)|$ and $|D_b(n)|$ to the author's knowledge and have enabled us to tabulate them up to $n=118$, the majority of which were unknown. The available numerical results of $|D(n)|$ tend to give more supporting evidence of a conjecture of Gordon F. Royle about the limit of $|D(n)|/|D(n-1)|$. The OEIS entries that can be computed by algorithms in this paper are A004251, A007721, A007722 and A095268.

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

↑