Computing the atom graph of a graph and the union join graph of a hypergraph

TL;DR

This paper introduces efficient algorithms for computing the atom graph of a graph and extends these methods to the union join graph of hypergraphs, improving computational efficiency in graph and hypergraph decompositions.

Contribution

The paper presents two new algorithms for efficiently computing the atom graph and extends these methods to hypergraphs for the first time.

Findings

Algorithms run in optimal time complexity for atom graph computation.

Extended methods successfully compute union join graphs of hypergraphs.

Enhanced understanding of graph and hypergraph decomposition structures.

Abstract

The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing this atom graph, with a complexity in $O(min(n^\alpha \log n, nm, n(n+\overline{m}))$ time, which is no more than the complexity of computing the atoms in the general case. %\par We extend our results to $\alpha$-acyclic hypergraphs. We introduce the notion of union join graph, which is the union of all possible join trees; we apply our algorithms for atom graphs to efficiently compute union join graphs. Keywords: clique separator decomposition, atom tree, atom graph, clique tree, clique graph, $\alpha$-acyclic hypergraph.