An efficient algorithm for computing permanental polynomials of graphs (Q710005): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cpc.2006.03.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2149366817 / rank | |||
Normal rank |
Revision as of 21:16, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm for computing permanental polynomials of graphs |
scientific article |
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