Ahat, Betül.
(Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2016., 2016.)
In this thesis, we investigate Maximum Induced Matching problem (MIM), nding an induced matching having the largest cardinality. The problem is NP-hard for general graphs. We develop a binary integer programming formulation ...