Fast algorithms for some dominating induced matching problems |
| |
Authors: | Min Chih Lin Michel J Mizrahi Jayme L Szwarcfiter |
| |
Affiliation: | 1. Departamento de Computación, Universidad de Buenos Aires, Argentina;2. Instituto de Matemática, NCE and COPPE, Universidade Federal do Rio de Janeiro, Brazil;3. Instituto Nacional de Metrologia, Qualidade e Tecnologia, Brazil |
| |
Abstract: | 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, 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 a variation of the existing algorithm for solving the unweighted version of the problem, which decreases its complexity from O(n2) to O(n), while additionally solving the weighted version. The same algorithm can be easily modified to count the number of DIM's of the given graph. |
| |
Keywords: | Algorithms Dominating induced matchings Graph theory |
本文献已被 ScienceDirect 等数据库收录! |
|