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

DOI10.1016/J.CPC.2004.08.003MaRDI QIDQ709589zbMATH OpenOpenAlexFDO

Authors 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.2004.08.003

zbMATH Keywords

adjacency matrixfullerenespermanent of matrixstructure-preserving algorithm

Mathematics Subject Classification ID

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

Recommendations

• A fast computer algorithm for finding the permanent of adjacency matrices
• An efficient algorithm for computing permanental polynomials of graphs
• Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
• New structural parameters and permanents of adjacency matrices of fullerenes
• Improved algorithms for permanent and permanently polynomial of sparse graph

Cites work

• A fast computer algorithm for finding the permanent of adjacency matrices
• A Method for Finding Permanents of 0, 1 Matrices
• A Monte-Carlo Algorithm for Estimating the Permanent
• Approximating the number of monomer-dimer coverings of a lattice.
• Approximating the Permanent
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Approximating the permanent: A simple approach
• Calculation of the permanent of a sparse positive matrix
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• Permanents
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• The complexity of computing the permanent
• The permanent of 0-1 matrices and Kallman's algorithm

Cited in

(8)

• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
• A fast computer algorithm for finding the permanent of adjacency matrices
• A mathematical programming model for computing the fries number of a fullerene
• A load balancing strategy for parallel computation of sparse permanents.
• scientific article; zbMATH DE number 5627531 (Why is no real title available?)
• Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
• New structural parameters and permanents of adjacency matrices of fullerenes
• An efficient algorithm for computing permanental polynomials of graphs

This page was built for publication: A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes

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