Discrete Applied Mathematics
Discrete Applied Mathematics - Combinatorial Optimization
Irredundancy in circular arc graphs
Discrete Applied Mathematics
On the 2-chain subgraph cover and related problems
Journal of Algorithms
SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
On the complexity of the k-chain subgraph cover problem
Theoretical Computer Science
Graph classes: a survey
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
New results on induced matchings
Discrete Applied Mathematics
On the powers of graphs with bounded asteroidal number
Discrete Mathematics
Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
SIAM Journal on Computing
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
Linear time maximum induced matching algorithm for trees
Nordic Journal of Computing
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Discrete Applied Mathematics
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
Maximum induced matching problem on hhd-free graphs
Discrete Applied Mathematics
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Maximum regular induced subgraphs in 2P3-free graphs
Theoretical Computer Science
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Hi-index | 0.00 |
An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of finding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We first define a wider class of graphs called the line-asteroidal triple-free (LAT-free) graphs which contains AT-free graphs as a subclass. By examining the square of line graph of LAT-free graphs, we give a characterization of them and apply this for showing that the maximum induced matching problem and a generalization, called the maximum δ-separated matching problem, on LAT-free graphs can be solved in polynomial time. In fact, our result can be extended to the classes of graphs with bounded asteroidal index. Next, we propose a linear-time algorithm for finding a maximum induced matching in a bipartite permutation (bipartite AT-free) graph using the greedy approach. Moreover, we show that using the same technique the minimum chain subgraph cover problem on bipartite permutation graphs can be solved with the same time complexity.