Back to Search
Start Over
An efficient algorithm for computing permanental polynomials of graphs
- Source :
-
Computer Physics Communications . Aug2006, Vol. 175 Issue 3, p196-203. 8p. - Publication Year :
- 2006
-
Abstract
- Abstract: 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 , while the largest fullerene computed before is . Extensive numerical computations show that the algorithm is fast and stable. [Copyright &y& Elsevier]
- Subjects :
- *POLYNOMIALS
*ALGORITHMS
*ALGEBRA
*FOUNDATIONS of arithmetic
Subjects
Details
- Language :
- English
- ISSN :
- 00104655
- Volume :
- 175
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Computer Physics Communications
- Publication Type :
- Periodical
- Accession number :
- 21495082
- Full Text :
- https://doi.org/10.1016/j.cpc.2006.03.002