The permanent of 0,1 matrices and Kallmanʹs algorithm Original Research Article

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 evaluated on the Cray C90, a single processor of the Cray T3D and SiliconGraphics Onyx2, and the PC platform. The Cray C90 FORTRAN 77 version presented here compiles without modification using the Cray Fortran 90 compiler and timing comparisons with FORTRAN 77 are discussed. Included with the package are six test cases taken from the molecular chemistry application with matrix orders n=30,44,48,52,56, 60, and data for orders n=5 to 20 in a special case where the value of the permanent is known.