This paper is a review which presents and explains the decomposition of graphs by clique
minimal separators. The pace is leisurely, we give many examples and figures. Easy …

Given a graph, its hyperbolicity is a measure of how close its distance distribution is to the
one of a tree. This parameter has gained recent attention in the analysis of some graph …

We study the complexity of decomposing a graph by means of clique separators. This
common algorithmic tool, first introduced by Tarjan, allows one to cut a graph into smaller …

The atom graph of a connected graph is a graph whose vertices are the atoms obtained by
clique minimal separator decomposition of this graph, and whose edges are the edges of all …

The decomposition of graphs by clique-minimal separators is a common algorithmic tool,
first introduced by Tarjan. Since it allows to cut a graph into smaller pieces, it can be applied …

В работе исследуется задача разложения гиперграфа на атомы кликовыми
минимальными сепараторами. Показана уникальность такого разложения …

Efficient clique decomposition of a graph into its atom graph Page 1 HAL Id: hal-00678702
https://hal.science/hal-00678702 Submitted on 13 Mar 2012 HAL is a multi-disciplinary open …

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 …

We propose a graph decomposition algorithm for analyzing the structure of complex graph
networks. After multi-word term extraction, we apply techniques from text mining and visual …

We present a symbolic and graph-based approach for mapping knowledge domains. The
symbolic component relies on shallow linguistic processing of texts to extract multi-word …