An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:16, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs |
scientific article |
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
