Minimum maximal matching is NP-hard in regular bipartite graphs
| Başlık | Minimum maximal matching is NP-hard in regular bipartite graphs |
| Publication Type | Journal Article |
| Year of Publication | 2008 |
| Authors | Demange, M., and T. Ekim |
| Journal | Theory and Applications of Models of Computation |
| Pagination | 364–374 |
