A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes

DOI10.1016/j.cpc.2004.08.003zbMath1196.15005OpenAlexW2128300776MaRDI QIDQ709589

Heng Liang, 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.2004.08.003

zbMATH Keywords

adjacency matrixfullerenesstructure-preserving algorithmpermanent of matrix

Mathematics Subject Classification ID

Chemistry (92E99) Iterative numerical methods for linear systems (65F10) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items

An efficient algorithm for computing permanental polynomials of graphs, 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
• Approximating the permanent via importance sampling with application to the dimer covering problem
• A fast computer algorithm for finding the permanent of adjacency matrices
• Approximating the number of monomer-dimer coverings of a lattice.
• The permanent of 0-1 matrices and Kallman's algorithm
• Approximating the Permanent
• A Method for Finding Permanents of 0, 1 Matrices
• A Monte-Carlo Algorithm for Estimating the Permanent
• Approximating the permanent: A simple approach
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• Permanents
• Unnamed Item
• Unnamed Item