Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors (Q1403184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors |
scientific article; zbMATH DE number 1973003
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors |
scientific article; zbMATH DE number 1973003 |
Statements
Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors (English)
0 references
1 September 2003
0 references
