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 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:24, 30 January 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
