O(n) Time Algorithms for Dominating Induced Matching Problems
We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the maximum number of edges that a graph having a dominating induced matching may contain. By applying these bounds, countings and employing existing O(n + m) time algorithms we show that they can be reduced to O(n) time. For claw–free graphs, we describe an algorithm based on that by Cardoso, Korpelainen and Lozin , for solving the unweighted version of the problem, which decreases its complexity from O(n 2) to O(n), while additionally solving the weighted version.
Keywordsalgorithms dominating induced matchings graph theory
Unable to display preview. Download preview PDF.
- 7.Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L.: Exact algorithms for dominating induced matchings. CoRR, abs/1301.7602 (2013)Google Scholar