Efficient clique decomposition of a graph into its atom graph

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.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00678702
Author Berry, Anne, Pogorelcnik, Romain, Simonet, Geneviève
Maintainer CCSD
Last Updated May 24, 2026, 21:37 (UTC)
Created May 24, 2026, 21:37 (UTC)
Identifier hal-00678702
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)
creator Berry, Anne
date 2010-03-10T00:00:00
harvest_object_id 16f05cbf-35d2-4305-84ca-1d6368cb7b53
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2023-04-18T00:00:00
set_spec type:REPORT