A matching algorithm for regular bipartite graphs (Q1186308)
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: A matching algorithm for regular bipartite graphs |
scientific article; zbMATH DE number 36442
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A matching algorithm for regular bipartite graphs |
scientific article; zbMATH DE number 36442 |
Statements
A matching algorithm for regular bipartite graphs (English)
0 references
28 June 1992
0 references
An algorithm for finding a perfect matching in \(r\)-regular bipartite multigraphs is given which uses \(O(n^ 2 r\log r)\) time and \(O(1)\) space.
0 references
bipartite graphs
0 references
perfect matching
0 references
