Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56626048, #quickstatements; #temporary_batch_1705103307034 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast and Simple Algorithm for the Maximum Flow Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4038695 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new approach to the maximum-flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90195-n / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1541277988 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) |
scientific article |
Statements
Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (English)
0 references
1991
0 references
analysis of algorithms
0 references
matching
0 references
bipartite graph
0 references
