A fast computer algorithm for finding the permanent of adjacency matrices

DOI10.1007/BF01164652zbMATH Open0873.65048MaRDI QIDQ1360652FDOQ1360652

Authors: Gordon G. Cash 

Publication date: 5 November 1997

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

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

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)