An introduction to clique minimal separator decomposition (Q1662549)

From MaRDI portal
Revision as of 22:01, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers