An efficient algorithm for computing permanental polynomials of graphs
From MaRDI portal
Publication:710005
DOI10.1016/j.cpc.2006.03.002zbMath1196.65093MaRDI 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
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
65T60: Numerical methods for wavelets
65H05: Numerical computation of solutions to single equations
Related Items
Graphs determined by the (signless) Laplacian permanental polynomials, On the permanental nullity and matching number of graphs, Characterizing properties of permanental polynomials of lollipop graphs, 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, Highly unique network descriptors based on the roots of the permanental polynomial, On the normalized Laplacian permanental polynomial of a graph, A load balancing strategy for parallel computation of sparse permanents, Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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]
