An 0(n log n) algorithm for the convex bipartite matching problem (Q792885)
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 0(n log n) algorithm for the convex bipartite matching problem |
scientific article; zbMATH DE number 3854828
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An 0(n log n) algorithm for the convex bipartite matching problem |
scientific article; zbMATH DE number 3854828 |
Statements
An 0(n log n) algorithm for the convex bipartite matching problem (English)
0 references
1984
0 references
maximum cardinality matching problem
0 references
convex bipartite graphs
0 references
special data structure
0 references
binary heap
0 references
0 references
0 references
0.9022901
0 references
0.8970264
0 references
0.8895557
0 references
0.88733643
0 references
0.8846892
0 references
0.88332766
0 references
0.8829043
0 references
