A fast computer algorithm for finding the permanent of adjacency matrices

DOI10.1007/BF01164652zbMath0873.65048MaRDI QIDQ1360652

Gordon G. Cash

Publication date: 5 November 1997

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

zbMATH Keywords

sparse matricespermanentsKekulé structurechemical adjacency matricesfast computer algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of determinants (65F40)

Related Items (2)

The expected characteristic and permanental polynomials of the random Gram matrix ⋮ A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A fast computer algorithm for finding the permanent of adjacency matrices