An introduction to clique minimal separator decomposition (Q1662549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An introduction to clique minimal separator decomposition |
scientific article; zbMATH DE number 6920520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An introduction to clique minimal separator decomposition |
scientific article; zbMATH DE number 6920520 |
Statements
An introduction to clique minimal separator decomposition (English)
0 references
20 August 2018
0 references
Summary: 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 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.
0 references
graph decomposition
0 references
clique minimal separator
0 references
minimal triangulation
0 references
0.8414936661720276
0 references
0.8355826139450073
0 references
0.8257429003715515
0 references
0.8155521750450134
0 references
