Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (Q2875130)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6330042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs |
scientific article; zbMATH DE number 6330042 |
Statements
13 August 2014
0 references
Birkhoff-von Neumann decomposition
0 references
bipartite regular graphs
0 references
graph algorithms
0 references
matchings
0 references
Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (English)
0 references
0.9991961717605592
0 references
0.9239174127578736
0 references
0.9212982654571532
0 references
0.9208359122276306
0 references
0.8867588639259338
0 references
