An Introduction to Clique Minimal Separator Decomposition
نویسندگان
چکیده
This paper is a review which presents and explains the decomposition by clique minimal separators, which is a promising tool for representing and decomposing experimental data. The pace is leisurely, we give many examples and figures. Easy algorithms are provided to implement this decomposition. The historical and theoretical background is given, as well as sketches of proofs of the structural results involved.
منابع مشابه
Organizing the atoms of the clique separator decomposition into an atom tree
We define an atom tree of a graph as a generalization of a clique tree: its nodes are the atoms obtained by clique minimal separator decomposition, and its edges correspond to the clique minimal separators of the
متن کاملDécomposition par séparateurs minimaux complets et applications
We worked on clique minimal separator decomposition. In order to compute this decomposition on a graph G we need to compute the minimal separators of its triangulation H. In this context, the first efforts were on finding a clique minimal separators in a chordal graph. We defined a structure called atom tree inspired from the clique tree to compute and represent the final products of the decomp...
متن کاملVertical Decomposition of a Lattice Using Clique Separators
A concept (or Galois) lattice is built on a binary relation; this relation can be represented by a bipartite graph. We explain how we can use the graph tool of clique minimal separator decomposition to decompose some bipartite graphs into subgraphs in linear time; each subgraph corresponds to a subrelation. We show that the lattices of these subrelations easily yield the lattice of the global r...
متن کامل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.
متن کاملGraph Decomposition Approaches for Terminology Graphs
We propose a graph-based decomposition methodology of a network of document features represented by a terminology graph. The graph is automatically extracted from raw data based on Natural Language Processing techniques implemented in the TermWatch system. These graphs are Small Worlds. Based on clique minimal separators and the associated graph of atoms: a subgraph without clique separator, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Algorithms
دوره 3 شماره
صفحات -
تاریخ انتشار 2010