An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151412766 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Matrix and Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023519 / rank | |||
Normal rank | |||
Latest revision as of 07:18, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adjustable linear time parallel algorithm for maximum weight bipartite matching |
scientific article |
Statements
An adjustable linear time parallel algorithm for maximum weight bipartite matching (English)
0 references
18 December 2009
0 references
parallel algorithms
0 references
graph algorithms
0 references
bipartite matching
0 references
