Remarks on implementation of <i>O</i> ( <i>n</i> <sup>1/2</sup> τ) assignment algorithms (Q3793631): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:53, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Remarks on implementation of <i>O</i> ( <i>n</i> <sup>1/2</sup> τ) assignment algorithms |
scientific article |
Statements
Remarks on implementation of <i>O</i> ( <i>n</i> <sup>1/2</sup> τ) assignment algorithms (English)
0 references
1988
0 references
Block triangularization
0 references
breadth first search
0 references
depth first search
0 references
graph theory
0 references
marriage problem
0 references
maximum assignment
0 references
maximum transversal
0 references
sparse matrices
0 references
sparse systems
0 references
transversal algorithms
0 references
zero-free diagonal
0 references
