Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs (Q4370201)
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 1104328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs |
scientific article; zbMATH DE number 1104328 |
Statements
19 October 1998
0 references
matchings
0 references
bipartite graph
0 references
algorithms
0 references
0.8422760963439941
0 references
0.8182593584060669
0 references
0.8177233934402466
0 references
Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs (English)
0 references
Algorithms are given for enumerating all perfect, maximum and maximal matchings in bipartite graphs \(G=(V,E)\). A matching \(M\subset V\) is (i) perfect if each vertex of \(V\) is incident to some edge of \(M\), (ii) a maximum matching if its cardinality is maximum over all matchings, and (iii) maximal if it is contained in no other matching. The running time of the algorithms is \(O(| V|)\) per matching plus a small overhead. For the entire collection see [Zbl 0879.00060].
0 references
