A fast computer algorithm for finding the permanent of adjacency matrices

摘要

A fast computer algorithm is described which brings computation of the permanents of sparse matrices, specifically, chemical adjacency matrices, within the reach of a desktop computer. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekule structure count. Also presented is a C-language implementation which was deliberately written for ease of translation into other high-level languages.