This paper is a review which presents and explains the decomposition of graphs by clique minimal separators. The pace is leisurely, we give many examples and figures. Easy algorithms are provided to implement this decomposition. The historical and theoretical background is given, as well as sketches of proofs of the structural results involved
AbstractWe define a family of graphs, called the clique separable graphs, characterized by the fact ...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
International audienceWe study the complexity of decomposing a graph by means of clique separators. ...
This paper is a review which presents and explains the decomposition of graphs by clique minimal sep...
International audienceThis paper is a review which presents and explains the decomposition of graphs...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
We present a new representation of a chordal graph called the clique-separator graph, whose nodes ar...
In this paper we give a historical and theoretical background to minimal triangulation and its relat...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
AbstractWe consider the problem of decomposing a graph by means of clique separators, by which we me...
We present a minimal counterexample to an O(|V||E|) algorithm for decomposing a graph G=(V,E) by max...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe consider the problem of decomposing a graph by means of clique separators, by which we me...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
AbstractWe define a family of graphs, called the clique separable graphs, characterized by the fact ...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
International audienceWe study the complexity of decomposing a graph by means of clique separators. ...
This paper is a review which presents and explains the decomposition of graphs by clique minimal sep...
International audienceThis paper is a review which presents and explains the decomposition of graphs...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
We present a new representation of a chordal graph called the clique-separator graph, whose nodes ar...
In this paper we give a historical and theoretical background to minimal triangulation and its relat...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
AbstractWe consider the problem of decomposing a graph by means of clique separators, by which we me...
We present a minimal counterexample to an O(|V||E|) algorithm for decomposing a graph G=(V,E) by max...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe consider the problem of decomposing a graph by means of clique separators, by which we me...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
AbstractWe define a family of graphs, called the clique separable graphs, characterized by the fact ...
We present an efficient algorithm which computes the set of minimal separators of a graph in O(n³) t...
International audienceWe study the complexity of decomposing a graph by means of clique separators. ...
DOI
Add to ORKG