An 0(n log n) algorithm for the convex bipartite matching problem (Q792885): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(84)90068-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2043765170 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching in a convex bipartite graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707420 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:42, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An 0(n log n) algorithm for the convex bipartite matching problem |
scientific article |
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
