An introduction to clique minimal separator decomposition (Q1662549): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3390/a3020197 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072082202 / rank | |||
Normal rank | |||
Revision as of 22:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An introduction to clique minimal separator decomposition |
scientific article |
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
