Marc Demange, Tinaz Ekim. Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. In Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li, editors, Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi an, China, April 25-29, 2008. Proceedings. Volume 4978 of Lecture Notes in Computer Science, pages 364-374, Springer, 2008. [doi]
@inproceedings{DemangeE08,
title = {Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs},
author = {Marc Demange and Tinaz Ekim},
year = {2008},
doi = {10.1007/978-3-540-79228-4_32},
url = {http://dx.doi.org/10.1007/978-3-540-79228-4_32},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DemangeE08},
cites = {0},
citedby = {0},
pages = {364-374},
booktitle = {Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi an, China, April 25-29, 2008. Proceedings},
editor = {Manindra Agrawal and Ding-Zhu Du and Zhenhua Duan and Angsheng Li},
volume = {4978},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-79227-7},
}