An efficient algorithm for computing permanental polynomials of graphs

DOI10.1016/J.CPC.2006.03.002zbMATH Open1196.65093OpenAlexW2149366817MaRDI QIDQ710005FDOQ710005

Authors: Yan Huo, Heng Liang, Fengshan 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

Recommendations

• Improved algorithms for permanent and permanently polynomial of sparse graph
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
• Computing the permanental polynomials of graphs
• A fast computer algorithm for finding the permanent of adjacency matrices

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)

Cites Work

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

Cited In (16)

• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Characterizing properties of permanental polynomials of lollipop graphs
• Computing the permanental polynomials of graphs
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• Highly unique network descriptors based on the roots of the permanental polynomial
• Constructing graphs which are permanental cospectral and adjacency cospectral
• Graphs determined by the (signless) Laplacian permanental polynomials
• Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
• Improved algorithms for permanent and permanently polynomial of sparse graph
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• On the normalized Laplacian permanental polynomial of a graph
• A polynomial algorithm for the parity path problem on perfectly orientable graphs
• Title not available (Why is that?)
• A load balancing strategy for parallel computation of sparse permanents.
• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
• On the permanental nullity and matching number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710005)