Bounding and approximating minimum maximal matchings in regular graphs

Julien Baste (1, 2) , Maximilian Fürst (2) , Michael Henning (3) , Elena Mohr (2) , Dieter Rautenbach (2)

1 ORKAD - Operational Research, Knowledge And Data
2 Universität Ulm - Ulm University [Ulm, Allemagne]
3 UJ - University of Johannesburg [South Africa]

Domaines: Mathématique discrète [cs.DM]; Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

Julien Baste, Maximilian Fürst, Michael Henning, Elena Mohr, Dieter Rautenbach. Bounding and approximating minimum maximal matchings in regular graphs. Discrete Mathematics, 2021, 344 (3), pp.112243. ⟨10.1016/j.disc.2020.112243⟩. ⟨hal-03469370⟩