Results 1 
8 of
8
On the approximability of the maximum induced matching problem
 Journal of Discrete Algorithms
, 2005
"... In 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 dregular graphs, for each d ≥ 3. We also prove that MIM is APXcomplete in dregular graphs, for each d ≥ 3. ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
In 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 dregular graphs, for each d ≥ 3. We also prove that MIM is APXcomplete in dregular graphs, for each d ≥ 3.
On Minimal Prime Extensions of a FourVertex Graph in a Prime Graph
, 2002
"... In a finite undirected graph G = (V; E), a homogeneous set is a set U V of at least two vertices such that every vertex in V n U is either adjacent to all vertices of U or nonadjacent to all of them. A graph is prime if it does not have a homogeneous set. We investigate the minimum... ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In a finite undirected graph G = (V; E), a homogeneous set is a set U V of at least two vertices such that every vertex in V n U is either adjacent to all vertices of U or nonadjacent to all of them. A graph is prime if it does not have a homogeneous set. We investigate the minimum...
New Graph Classes of Bounded CliqueWidth
, 2003
"... Cliquewidth of graphs is a major new concept with respect to efficiency of graph algorithms; it is known that every problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L ) by Courcelle, Makowsky and Rotics, is lineartime solvable on any graph class with bounded c ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Cliquewidth of graphs is a major new concept with respect to efficiency of graph algorithms; it is known that every problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L ) by Courcelle, Makowsky and Rotics, is lineartime solvable on any graph class with bounded cliquewidth for which a kexpression for the input graph can be constructed in linear time. The notion of cliquewidth...
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set problem
, 2007
"... ..."
Efficient Robust Algorithms for the Maximum Weight Stable Set Problem in Chairfree Graph Classes
, 2001
"... Modular decomposition of graphs is a powerful tool for designing efficient algorithms for algorithmic graph problems such as the Maximum Weight Stable Set Problem and the Maximum Weight Clique Problem. Using this tool we obtain O(nm) time algorithms for the Maximum Weight Stable Set Problem on (chai ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Modular decomposition of graphs is a powerful tool for designing efficient algorithms for algorithmic graph problems such as the Maximum Weight Stable Set Problem and the Maximum Weight Clique Problem. Using this tool we obtain O(nm) time algorithms for the Maximum Weight Stable Set Problem on (chair, coP)free, (chair,P5)free and (chair,bull)free graphs. Moreover, our algorithms are robust in the sense that we do not have to check in advance whether the input graphs are indeed (chair, coP)free or (chair,P5)free or (chair,bull)free.
Classes of Perfect Graphs
, 2003
"... Abstract. The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Po ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Powerful concepts and methods have been developed to prove the Strong Perfect Graph Conjecture for these special cases. In this paper we survey 120 of these classes, list their fundamental algorithmic properties and present all known relations between them. 1