AbstractIn this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio d−1 for MIM in d-regular graphs, for each d⩾3. We also prove that MIM is APX-complete in d-regular graphs, for each d⩾3
An induced matching is a matching where no two edges are connected by a third edge. Finding a maximu...
AbstractWe present a heuristic for finding a large induced matching of cubic graphs. We analyse the ...
We show that the maximum induced matching problem can be solved on hhd-free graphs in O(m2) time; hh...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
In this paper, we investigate the maximum induced matching problem (MaxIM) on C5-free d-regular grap...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any...
The maximum induced matching problem is known to be APX-hard in the class of bipartite graphs. Moreo...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
The maximum induced matching problem is known to be APX-hard in the class of bipartite graphs. Moreo...
AbstractAn induced matching M of a graph G is a set of pairwise non-adjacent edges such that their e...
An induced matching is a matching where no two edges are connected by a third edge. Finding a maximu...
AbstractWe present a heuristic for finding a large induced matching of cubic graphs. We analyse the ...
We show that the maximum induced matching problem can be solved on hhd-free graphs in O(m2) time; hh...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
In this paper, we investigate the maximum induced matching problem (MaxIM) on C5-free d-regular grap...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any...
The maximum induced matching problem is known to be APX-hard in the class of bipartite graphs. Moreo...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
The maximum induced matching problem is known to be APX-hard in the class of bipartite graphs. Moreo...
AbstractAn induced matching M of a graph G is a set of pairwise non-adjacent edges such that their e...
An induced matching is a matching where no two edges are connected by a third edge. Finding a maximu...
AbstractWe present a heuristic for finding a large induced matching of cubic graphs. We analyse the ...
We show that the maximum induced matching problem can be solved on hhd-free graphs in O(m2) time; hh...
DOI
Add to ORKG