Open AccessThis article is
- freely available
An Introduction to Clique Minimal Separator Decomposition
LIMOS UMR CNRS 6158, Ensemble Scientifique des Cézeaux, F-63 173 Aubière, France;
LIRMM, 161 Rue Ada, F-34392 Montpellier, France
* Author to whom correspondence should be addressed.
Received: 7 April 2010; in revised form: / Accepted: 28 April 2010 / Published: 14 May 2010
Abstract: 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
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Berry, A.; Pogorelcnik, R.; Simonet, G. An Introduction to Clique Minimal Separator Decomposition. Algorithms 2010, 3, 197-215.
Berry A, Pogorelcnik R, Simonet G. An Introduction to Clique Minimal Separator Decomposition. Algorithms. 2010; 3(2):197-215.
Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève. 2010. "An Introduction to Clique Minimal Separator Decomposition." Algorithms 3, no. 2: 197-215.