Efficient clique decomposition of a graph into its atom graph
Anne Berry, Romain Pogorelcnik, Geneviève Simonet · 2010
We explain how to organize the atoms resulting from clique minimal separator decomposition into a metagraph which we call the atom graph, and give an efficient recursive algorithm to compute this graph at no extra cost than computing the atoms.