Algorithms 2010, 3(2), 197-215; doi:10.3390/a3020197

An Introduction to Clique Minimal Separator Decomposition

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)
PDF Full-text Download PDF Full-Text [164 KB, uploaded 14 May 2010 08:27 CEST]
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 Statistics

Load and display the download statistics.

Citations to this Article

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.

AMA Style

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

Chicago/Turabian Style

Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève. 2010. "An Introduction to Clique Minimal Separator Decomposition." Algorithms 3, no. 2: 197-215.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert