Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs (Q2875130)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs |
scientific article |
Statements
Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs (English)
0 references
13 August 2014
0 references
Birkhoff-von Neumann decomposition
0 references
bipartite regular graphs
0 references
graph algorithms
0 references
matchings
0 references
