Graph decomposition approaches for terminology graphs, Proc. MICAI, pp.883-893, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01318619
Clustering gene expression data using graph separators, In Silico Biol, vol.7, pp.433-452, 2007. ,
On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universit??t Hamburg, vol.13, issue.1-2, pp.71-76, 1961. ,
DOI : 10.1007/BF02992776
Triangulated graphs and the elimination process, Journal of Mathematical Analysis and Applications, vol.32, issue.3, pp.597-609, 1970. ,
DOI : 10.1016/0022-247X(70)90282-9
A simple algorithm to generate the minimal separators of a chordal graph, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00678694
Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981. ,
DOI : 10.1137/0602010
Minimal fill in O(n 2.69 ) time. Discrete Math, pp.366-371, 2006. ,
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376), SIAM Journal on Discrete Mathematics, vol.19, issue.4, pp.900-913, 2005. ,
DOI : 10.1137/S0895480104445010
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs, Algorithmica, vol.39, issue.4, pp.287-298, 2004. ,
DOI : 10.1007/s00453-004-1084-3
A wide-range algorithm for minimal triangulation from an arbitrary ordering, Journal of Algorithms, vol.58, issue.1, pp.33-66, 2006. ,
DOI : 10.1016/j.jalgor.2004.07.001
URL : https://hal.archives-ouvertes.fr/lirmm-00269411
A vertex incremental approach for maintaining chordality. Discrete Math, pp.318-336, 2006. ,
Minimal triangulations of graphs: A survey. Discrete Math, pp.297-317, 2006. ,
Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976. ,
DOI : 10.1137/0205021
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.428-446, 2009. ,
DOI : 10.1137/070684355
URL : https://hal.archives-ouvertes.fr/lirmm-00366108
Decomposition by clique separators. Discrete Math, pp.221-232, 1985. ,
DOI : 10.1016/0012-365x(85)90051-2
URL : http://doi.org/10.1016/0012-365x(85)90051-2
Algorithms on clique separable graphs. Discrete Math, pp.159-165, 1977. ,
DOI : 10.1016/0012-365x(77)90030-9
URL : http://doi.org/10.1016/0012-365x(77)90030-9
An algorithm for finding clique cut-sets, Information Processing Letters, vol.12, issue.1, pp.31-32, 1981. ,
DOI : 10.1016/0020-0190(81)90072-7
Fast parallel algorithms for the clique separator decomposition, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms: SODA '90, pp.244-251, 1990. ,
Optimal decomposition by clique separators. Discrete Math, pp.99-123, 1993. ,
DOI : 10.1016/0012-365x(93)90510-z
URL : http://doi.org/10.1016/0012-365x(93)90510-z
Maximal prime subgraph decomposition of Bayesian networks, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.32, issue.1, pp.21-31, 2002. ,
DOI : 10.1109/3477.979956
An introduction to chordal graphs and clique trees. Graph Theory Sparse Matrix Comput, pp.1-29, 1993. ,
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem, Theoretical Computer Science, vol.389, issue.1-2, pp.295-306, 2007. ,
DOI : 10.1016/j.tcs.2007.09.031
Safe separators for treewidth. Discret Math, pp.337-350, 2006. ,