An Introduction to Clique Minimal Separator Decomposition
Résumé
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.
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...