An efficient algorithm for computing permanental polynomials of graphs
type: Item
instance of: scholarly article
title: An efficient algorithm for computing permanental polynomials of graphs
zbMATH Open document ID: 1196.65093
author: Yan Huo
author: Heng Liang
author: Fengshan Bai
published in: Computer Physics Communications
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 65T60
zbMATH DE Number: 5801666
zbMATH Keywords: permanental polynomial
zbMATH Keywords: adjacency matrix
zbMATH Keywords: graph
zbMATH Keywords: fullerene
zbMATH Keywords: FFT
MaRDI profile type: Publication
full work available at URL: j.cpc.2006.03.002
OpenAlex ID: W2149366817
cites work: Q4800134
cites work: Q4830188
cites work: Q4827548
cites work: On the permanental polynomials of some graphs
cites work: The complexity of computing the permanent
cites work: Q3851094
cites work: Q3932310
cites work: Calculation of the permanent of a sparse positive matrix
cites work: A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
cites work: A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
cites work: A hybrid algorithm for computing permanents of sparse matrices
cites work: Q3933016
cites work: Q5750905
cites work: Solution of Vandermonde systems of equations
cites work: Q5689624
DOI: 10.1016/J.CPC.2006.03.002
description: scientific article; zbMATH DE number 5801666