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

An Introduction to Clique Minimal Separator Decomposition

1,* email, 1email and 2email
Received: 7 April 2010; Accepted: 28 April 2010 / Published: 14 May 2010
(This article belongs to the Special Issue Algorithms for Applied Mathematics)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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
PDF Full-text Download PDF Full-Text [164 KB, uploaded 14 May 2010 08:27 CEST]

Export to BibTeX |

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