A fast computer algorithm for finding the permanent of adjacency matrices

DOI10.1007/BF01164652MaRDI QIDQ1360652zbMATH OpenFDO

Authors Gordon G. Cash

Publication date 5 November 1997

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

zbMATH Keywords

sparse matrices[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Kekul%EF%BF%BD%EF%BF%BD+structure&go=Go Kekul�� structure]permanentschemical adjacency matricesfast computer algorithm

Mathematics Subject Classification ID

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

Recommendations

• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• Improved algorithms for permanent and permanently polynomial of sparse graph
• A hybrid algorithm for computing permanents of sparse matrices
• New algorithms for calculation of logarithmic estimates for (0,1)-matrix permanents and their application to problems of chemical kinetics and combinatorial analysis

Cited in

(4)

• An efficient algorithm for computing permanental polynomials of graphs
• The expected characteristic and permanental polynomials of the random Gram matrix
• How fast can one compute the permanent of circulant matrices?
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes

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

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