A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We show that the maximum induced matching problem can be solved on hhd-free graphs in O(m 2 ) time; hhd-free graphs generalize chordal graphs and the previous best bound was O(m 3 ). Then, we consider a technique used by Brandstädt and Hoàng (2008)  to solve the problem on chordal graphs. Extending this, we show that for a subclass of hhd-free graphs that is more general than chordal graphs the problem can be solved in linear time. We also present examples to demonstrate the tightness of our results.doi:10.1016/j.dam.2011.08.027 fatcat:scppsdsrwvbmvfuczy2ld3gliy