An Introduction to Clique Minimal Separator Decomposition
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...
Main Authors: | Anne Berry, Romain Pogorelcnik, Geneviève Simonet |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2010-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/3/2/197/ |
Similar Items
-
Decomposition by complete minimum separators and applications
by: Pogorelcnik, Romain
Published: (2012) -
Characterizing Atoms that Result from Decomposition by Clique Separators
by: McKee Terry A.
Published: (2017-08-01) -
Clique roots of K4-free chordal graphs
by: Hossein Teimoori Faal
Published: (2019-04-01) -
Constructing perfect phylogenies and proper triangulations for three-state characters
by: Gysel Rob, et al.
Published: (2012-09-01) -
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01)