Efficient clique decomposition of a graph into its atom graph

Anne Berry (1) , Romain Pogorelcnik (1) , Geneviève Simonet (2)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 ALGCO - Algorithmes, Graphes et Combinatoire

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.

Mots clés: Atom graph; clique separator decomposition

Domaines: Mathématique discrète [cs.DM]

Anne Berry, Romain Pogorelcnik, Geneviève Simonet. Efficient clique decomposition of a graph into its atom graph. 2010. ⟨hal-00678702⟩