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 |
Authors | Demange, M., and T. Ekim |
Başlık | Minimum maximal matching is NP-hard in regular bipartite graphs |
Publication Type | Journal Article |
Authors | Demange, M., and T. Ekim |