AbstractA parallel algorithm to recognize cographs with a linear processor bound and a log2n time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (1991). As a consequence distance hereditary graphs can be recognized by the same processor and time bound
AbstractA simple parallel algorithm is presented for constructing parse tree representation of a ric...
AbstractCographs are a well-known class of graphs arising in a wide spectrum of practical applicatio...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
AbstractA parallel algorithm to recognize cographs with a linear processor bound and a log2n time bo...
AbstractIn this paper, we modify a known parallel cograph-recognition algorithm proposed by Nikolopo...
In this paper, we establish structural properties for the class of complement reducible graphs or co...
AbstractIn this paper, we establish structural properties for the class of complement reducible grap...
AbstractIn this paper, we establish structural properties for the class of complement reducible grap...
AbstractRecently, He and Yesha gave an algorithm for recognizing directed series-parallel graphs in ...
AbstractIn this paper, we modify a known parallel cograph-recognition algorithm proposed by Nikolopo...
AbstractAn easy way for graph recognition algorithms is to use a two-step process: first, compute a ...
AbstractIn this paper, we describe a new simple linear time algorithm to recognize cographs. Cograph...
International audienceRecently Lexicographic Breadth First Search (LexBFS) has been shown to be a ve...
AbstractCographs are a well-known class of graphs arising in a wide spectrum of practical applicatio...
Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently....
AbstractA simple parallel algorithm is presented for constructing parse tree representation of a ric...
AbstractCographs are a well-known class of graphs arising in a wide spectrum of practical applicatio...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
AbstractA parallel algorithm to recognize cographs with a linear processor bound and a log2n time bo...
AbstractIn this paper, we modify a known parallel cograph-recognition algorithm proposed by Nikolopo...
In this paper, we establish structural properties for the class of complement reducible graphs or co...
AbstractIn this paper, we establish structural properties for the class of complement reducible grap...
AbstractIn this paper, we establish structural properties for the class of complement reducible grap...
AbstractRecently, He and Yesha gave an algorithm for recognizing directed series-parallel graphs in ...
AbstractIn this paper, we modify a known parallel cograph-recognition algorithm proposed by Nikolopo...
AbstractAn easy way for graph recognition algorithms is to use a two-step process: first, compute a ...
AbstractIn this paper, we describe a new simple linear time algorithm to recognize cographs. Cograph...
International audienceRecently Lexicographic Breadth First Search (LexBFS) has been shown to be a ve...
AbstractCographs are a well-known class of graphs arising in a wide spectrum of practical applicatio...
Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently....
AbstractA simple parallel algorithm is presented for constructing parse tree representation of a ric...
AbstractCographs are a well-known class of graphs arising in a wide spectrum of practical applicatio...
Abstract. In this paper we consider the problem of computing the connected components of the complem...
DOI
Add to ORKG