A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
type: Item
instance of: scholarly article
title: A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
zbMATH Open document ID: 1196.15005
author: Heng Liang
author: Fengshan Bai
published in: Computer Physics Communications
publication date: 2010-10-18T00:00:00Z
Mathematics Subject Classification ID: 15-04
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 92E99
zbMATH DE Number: 5801400
zbMATH Keywords: permanent of matrix
zbMATH Keywords: adjacency matrix
zbMATH Keywords: structure-preserving algorithm
zbMATH Keywords: fullerenes
MaRDI profile type: Publication
full work available at URL: j.cpc.2004.08.003
OpenAlex ID: W2128300776
cites work: Permanents
cites work: The complexity of computing the permanent
cites work: Approximating the Permanent
cites work: A Monte-Carlo Algorithm for Estimating the Permanent
cites work: Approximating the permanent: A simple approach
cites work: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
cites work: Approximating the number of monomer-dimer coverings of a lattice.
cites work: Approximating the permanent via importance sampling with application to the dimer covering problem
cites work: Calculation of the permanent of a sparse positive matrix
cites work: A fast computer algorithm for finding the permanent of adjacency matrices
cites work: The permanent of 0-1 matrices and Kallman's algorithm
cites work: Q3851094
cites work: Q3932310
cites work: A Method for Finding Permanents of 0, 1 Matrices
DOI: 10.1016/J.CPC.2004.08.003
description: scientific article; zbMATH DE number 5801400