Speaker
Tinaz Ekim
(Boğaziçi University)
Description
Given a graph G, the problem of finding the minimum size maximal matching (MMM) is also known as the (independent) edge dominating set (EDS) in the literature. This problem, as well as several closely related problems, have been studied in the literature from several aspects such as computational complexity in special graph classes, approximation, exact solution procedures with experimental results etc. Structural properties related to MMM such as equimatchable and well-covered graphs are also well studied. In this talk, we will first mention some recent results related to MMM and then point out several current research directions and open questions.
Primary author
Tinaz Ekim
(Boğaziçi University)
