Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs |
scientific article; zbMATH DE number 6211608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs |
scientific article; zbMATH DE number 6211608 |
Statements
25 September 2013
0 references
graph algorithms
0 references
matchings
0 references
bipartite regular graphs
0 references
Birkhoff-von Neumann decomposition
0 references
Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (English)
0 references
