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

DOI10.1016/S0010-4655(99)00448-8zbMath0951.65043OpenAlexW1991063209MaRDI QIDQ1971539

George Delic, Gordon G. Cash

Publication date: 6 December 2000

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4655(99)00448-8

zbMATH Keywords

numerical examplesadjacency matrixpermanentKallman algorithm

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)

Related Items (3)

A hybrid algorithm for computing permanents of sparse matrices ⋮ A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes ⋮ A load balancing strategy for parallel computation of sparse permanents

This page was built for publication: The permanent of 0-1 matrices and Kallman's algorithm