.png){kind=icon}
返回
An efficient algorithm for computing permanental polynomials of graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2006.03.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 C-56, while the largest fullerene computed before is C-40. Extensive numerical computations show that the algorithm is fast and stable. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
permanental polynomial
adjacency matrix
graph
fullerene
FFT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
FB-REDA: fragment-based decomposition analysis of the reorganization energy for organic semiconductorsFb-reda: 有机半导体重组能的基于片段的分解分析
OAAI
OAAI分享收藏
查看更多内容