A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
DOI10.1016/J.CPC.2004.08.003zbMATH Open1196.15005OpenAlexW2128300776MaRDI QIDQ709589FDOQ709589
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
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
Chemistry (92E99) Iterative numerical methods for linear systems (65F10) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
- Approximating the number of monomer-dimer coverings of a lattice.
- The complexity of computing the permanent
- Title not available (Why is that?)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- Permanents
- Approximating the Permanent
- A Monte-Carlo Algorithm for Estimating the Permanent
- Title not available (Why is that?)
- Approximating the permanent: A simple approach
- Approximating the permanent via importance sampling with application to the dimer covering problem
- A fast computer algorithm for finding the permanent of adjacency matrices
- The permanent of 0-1 matrices and Kallman's algorithm
- A Method for Finding Permanents of 0, 1 Matrices
- Calculation of the permanent of a sparse positive matrix
Cited In (7)
- Title not available (Why is that?)
- Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
- An efficient algorithm for computing permanental polynomials of graphs
- A mathematical programming model for computing the fries number of a fullerene
- New structural parameters and permanents of adjacency matrices of fullerenes
- PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
- A load balancing strategy for parallel computation of sparse permanents.
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)
