Maximum induced matching problem on hhd-free graphs

Authors:
Chandra Mohan Krishnamurthy;R. Sritharan
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 10
Cited 0

Irredundancy in circular arc graphs

Discrete Applied Mathematics
LexBFS-orderings and powers of chordal graphs

Discrete Mathematics
Duchet-type theorems for powers of HHD-free graphs

Discrete Mathematics
New results on induced matchings

Discrete Applied Mathematics
Finding a maximum induced matching in weakly chordal graphs

Discrete Mathematics - Special issue: The 18th British combinatorial conference
Induced matchings in asteroidal triple-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs

Theoretical Computer Science
Maximum Induced Matchings for Chordal Graphs in Linear Time

Algorithmica
A Min–Max Property of Chordal Bipartite Graphs with Applications

Graphs and Combinatorics
On distance-3 matchings and induced matchings

Discrete Applied Mathematics

Quantified Score

Hi-index	0.07

Visualization

Abstract

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 Brandstadt and Hoang (2008) [4] 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.