Next Article in Journal / Special Issue
Algorithmic Solution of Stochastic Differential Equations
Previous Article in Journal
Integrating New Technologies and Existing Tools to Promote Programming Learning
Algorithms 2010, 3(2), 197-215; doi:10.3390/a3020197

An Introduction to Clique Minimal Separator Decomposition

1,* , 1
1 LIMOS UMR CNRS 6158, Ensemble Scientifique des Cézeaux, F-63 173 Aubière, France; 2 LIRMM, 161 Rue Ada, F-34392 Montpellier, France
* Author to whom correspondence should be addressed.
Received: 7 April 2010 / Accepted: 28 April 2010 / Published: 14 May 2010
(This article belongs to the Special Issue Algorithms for Applied Mathematics)
View Full-Text   |   Download PDF [164 KB, uploaded 14 May 2010]   |   Browse Figures


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.
Keywords: graph decomposition; clique minimal separator; minimal triangulation graph decomposition; clique minimal separator; minimal triangulation
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Berry, A.; Pogorelcnik, R.; Simonet, G. An Introduction to Clique Minimal Separator Decomposition. Algorithms 2010, 3, 197-215.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert