1. [1] Bodur, M., Ekim, T., Taşkın, Z.C., Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem, Networks, 62, 273–287, 2013.
2. [2] Cardinal, J., Langerman, S., Levy, E., Improved Approximation Bounds for Edge Dominating Set in Dense Graphs, Theoretical Computer Science, 410, 949–957, 2009.
3. [3] Chlebík, M., Chlebíková, J., Approximation Hardness of Edge Dominating Set Problems, Journal of Combinatorial Optimization, 11(3), 279–290, 2006.
4. [4] Demange, M., Ekim, T., Minimum Maximal Matching is NP-Hard in Regular Bipartite Graphs, in Theory and Applications of Models of Computation, Lecture Notes in Computer Science, vol. 4978, Springer, Berlin, 2008.
5. [5] Horton, J.D., Kilakos, K., Minimum Edge Dominating Sets, SIAM Journal on Discrete Mathematics, 6(3), 375-387, 1993.