We present a simple unified algorithmic process which uses either LexBFS or MCS on a chordal graph to generate the minimal separators and the maximal cliques in linear time in a single pass
International audienceThe algorithm MLS (Maximal Label Search) is a graph search algorithm that gene...
We address the problem of computing the atoms of the decomposition by clique minimal separators of a...
AbstractAn algorithm for finding maximal chordal subgraphs is developed that has worst-case time com...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
We give O(m + n) algorithms for enumerating all minimum separators as well as minimal separators in ...
Chordal graphs form an important and widely studied subclass of perfect graphs. The set of minimal v...
We present a new representation of a chordal graph called the clique-separator graph, whose nodes ar...
AbstractA partitioning problem on chordal graphs that arises in the solution of sparse triangular sy...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
We present here some results on particular elimination schemes for chordal graphs, namely we show th...
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms...
International audienceThis paper is a review which presents and explains the decomposition of graphs...
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms...
International audienceThe algorithm MLS (Maximal Label Search) is a graph search algorithm that gene...
We address the problem of computing the atoms of the decomposition by clique minimal separators of a...
AbstractAn algorithm for finding maximal chordal subgraphs is developed that has worst-case time com...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
AbstractKumar and Madhavan [Minimal vertex separators of chordal graphs, Discrete Appl. Math. 89 (19...
We give O(m + n) algorithms for enumerating all minimum separators as well as minimal separators in ...
Chordal graphs form an important and widely studied subclass of perfect graphs. The set of minimal v...
We present a new representation of a chordal graph called the clique-separator graph, whose nodes ar...
AbstractA partitioning problem on chordal graphs that arises in the solution of sparse triangular sy...
AbstractWe present a new representation of a chordal graph called the clique-separator graph, whose ...
We present here some results on particular elimination schemes for chordal graphs, namely we show th...
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms...
International audienceThis paper is a review which presents and explains the decomposition of graphs...
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms...
International audienceThe algorithm MLS (Maximal Label Search) is a graph search algorithm that gene...
We address the problem of computing the atoms of the decomposition by clique minimal separators of a...
AbstractAn algorithm for finding maximal chordal subgraphs is developed that has worst-case time com...
DOI
Add to ORKG