OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (Q3130156)
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: OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS |
scientific article; zbMATH DE number 1002547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS |
scientific article; zbMATH DE number 1002547 |
Statements
OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (English)
0 references
22 April 1997
0 references
cost-optimal parallel algorithm
0 references
maximum matching problem
0 references
bipartite permutation graphs
0 references
0 references
0.86407071352005
0 references
0.8569144606590271
0 references
0.8385033011436462
0 references
