A Method for Finding Permanents of 0, 1 Matrices

DOI10.2307/2007472MaRDI QIDQ3944614zbMATH OpenOpenAlexFDO

Authors Ralph Kallman

Publication date 1982

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2007472

zbMATH Keywords

permanents of 0,1 matrices

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Determinants, permanents, traces, other special matrix functions (15A15) Algorithms in computer science (68W99)

Cited in

(5)

• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• A hybrid algorithm for computing permanents of sparse matrices
• A load balancing strategy for parallel computation of sparse permanents.
• Calculation of the permanent of a sparse positive matrix
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes

This page was built for publication: A Method for Finding Permanents of 0, 1 Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3944614)