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
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user 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 | |||
Revision as of 12:48, 21 June 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
