-
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... -
Clique separator decomposition in less than nm
We address the problem of computing the atoms of the decomposition by clique minimal separators of a graph G (also called the maximal prime subgraphs) when a minimal...
