An efficient algorithm for computing permanental polynomials of graphs (Q710005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for computing permanental polynomials of graphs |
scientific article; zbMATH DE number 5801666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for computing permanental polynomials of graphs |
scientific article; zbMATH DE number 5801666 |
Statements
An efficient algorithm for computing permanental polynomials of graphs (English)
0 references
18 October 2010
0 references
permanental polynomial
0 references
adjacency matrix
0 references
graph
0 references
fullerene
0 references
FFT
0 references
0 references
0 references
0.8419008851051331
0 references
0.7993605732917786
0 references
0.7940283417701721
0 references
0.7720370888710022
0 references
0.7648144364356995
0 references
