Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.

Marc Demange, Tnaz Ekim

Browse the full TAMC paper archive.