The Maximum Induced Matching Problem For Some Subclasses Of Weakly Chordal Graphs