The permanent of 0-1 matrices and Kallman's algorithm (Q1971539): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Gordon G. Cash / rank | |||
| Property / author | |||
| Property / author: Gordon G. Cash / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0010-4655(99)00448-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991063209 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:16, 30 July 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
