An efficient algorithm for computing permanental polynomials of graphs

DOI10.1016/j.cpc.2006.03.002zbMath1196.65093OpenAlexW2149366817MaRDI QIDQ710005

Heng Liang, Yan Huo, Feng-Shan Bai

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2006.03.002

zbMATH Keywords

graphFFTadjacency matrixpermanental polynomialfullerene

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical methods for wavelets (65T60) Numerical computation of solutions to single equations (65H05)

Related Items (11)

Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Computing the permanental polynomials of bipartite graphs by Pfaffian orientation ⋮ Computing the permanental polynomials of graphs ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ On the permanental nullity and matching number of graphs ⋮ Highly unique network descriptors based on the roots of the permanental polynomial ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ A load balancing strategy for parallel computation of sparse permanents

Cites Work

• The complexity of computing the permanent
• Calculation of the permanent of a sparse positive matrix
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• On the permanental polynomials of some graphs
• A hybrid algorithm for computing permanents of sparse matrices
• Solution of Vandermonde systems of equations
• A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)\) expected speedup for \(0-1\) matrices]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for computing permanental polynomials of graphs