An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90193-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023428944 / rank | |||
Normal rank | |||
Revision as of 20:52, 19 March 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
