A network flow algorithm to find an elementary I/O matching (Q3783058)
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 4045462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A network flow algorithm to find an elementary I/O matching |
scientific article; zbMATH DE number 4045462 |
Statements
A network flow algorithm to find an elementary I/O matching (English)
0 references
1988
0 references
dynamic system
0 references
network flow algorithm
0 references
matching
0 references
0.7512401938438416
0 references
0.7482786774635315
0 references
0.7298220992088318
0 references
0.709638774394989
0 references
