The permanent of 0-1 matrices and Kallman's algorithm (Q1971539)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1422857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The permanent of 0-1 matrices and Kallman's algorithm |
scientific article; zbMATH DE number 1422857 |
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
0.8051886558532715
0 references
0.804842472076416
0 references
0.8013240098953247
0 references
0.8003648519515991
0 references
