Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs |
scientific article |
Statements
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (English)
0 references
27 May 2008
0 references
stable marriage
0 references
unmatched pairs
0 references
Minimum Maximal Matching
0 references
regular bipartite graphs
0 references
