An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829)
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 O(n log n log log n) parallel maximum matching algorithm for bipartite graphs |
scientific article; zbMATH DE number 4011956
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs |
scientific article; zbMATH DE number 4011956 |
Statements
An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (English)
0 references
1987
0 references
bipartite graphs
0 references
parallel algorithm
0 references
serial algorithm
0 references
computational complexity
0 references
matching
0 references
tree
0 references
