An efficient algorithm for computing permanental polynomials of graphs
An efficient algorithm for computing permanental polynomials of graphs
复制标题
DOI：
10.1016/j.cpc.2006.03.002
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
Yan Huo;Heng Liang;F. Bai
中科院分区：
文献类型：
--
作者：
Yan Huo;Heng Liang;F. Bai
提出了一种计算图的永久多项式的有效数值方法。它适应FFT的多条目展开，本质上是并行的。它适用于富勒烯型图，适用于C56，而之前计算的最大富勒烯是C40。大量的数值计算表明，该算法快速、稳定。
An efficient numerical method for computing permanental polynomials of graphs is proposed. It adapts multi-entry expansion of FFT, and is parallel in nature. It is applied to fullerene-type graphs, and works for C56, while the largest fullerene computed before is C40. Extensive numerical computations show that the algorithm is fast and stable.