An Introduction to Clique Minimal Separator Decomposition
AbstractThis 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
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.Chicago/Turabian Style
Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève. 2010. "An Introduction to Clique Minimal Separator Decomposition." Algorithms 3, no. 2: 197-215.