The permanent of 0,1 matrices and Kallman's algorithm

Published: 01-01-2000| Version 1 | DOI: 10.17632/xwk8gbjk92.1
George Delic,
Gordon G. Cash


Abstract The Kallman algorithm for the computation of the permanent, per(A), of a matrix A has been ported to the Cray C90, tested on other platforms, and compared against several alternative algorithms. This report presents results of these comparisons for test cases where the permanent is known and also for cases of the adjacency matrix taken from molecular chemistry applications. The accompanying code includes both C90 and Personal Computer versions of the Kallman algorithm, and these have been eva... Title of program: KALLC90 and KALLPC Catalogue Id: ADLC_v1_0 Nature of problem Numerical evaluation of the permanent of a 0,1 matrix. Versions of this program held in the CPC repository in Mendeley Data ADLC_v1_0; KALLC90 and KALLPC; 10.1016/S0010-4655(99)00448-8 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)