AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER (Q4820064)
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: AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER |
scientific article; zbMATH DE number 2106663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER |
scientific article; zbMATH DE number 2106663 |
Statements
AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER (English)
0 references
6 October 2004
0 references
