The permanent of 0-1 matrices and Kallman's algorithm (Q1971539): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The permanent of 0-1 matrices and Kallman's algorithm |
scientific article |
Statements
The permanent of 0-1 matrices and Kallman's algorithm (English)
0 references
6 December 2000
0 references
\textit{R. Kallman}'s algorithm for computing the permanent of a 0-1-matrix [Math. Comput. 38, 167-170 (1982; Zbl 0485.05011)] is compared with several other previously known algorithms. Computational results are reported. The paper brings no new theoretical results.
0 references
permanent
0 references
Kallman algorithm
0 references
adjacency matrix
0 references
numerical examples
0 references
