Articles
Moplex elimination orderings

https://doi.org/10.1016/S1571-0653(05)80065-4Get rights and content

Abstract

Classically, triangulated graphs are characterized and recognized by way of perfect elimination orderings (peo, which correspond to an elimination scheme on simplicial vertices). Algorithm LexBFS computes such a peo efficiently, but is also useful for the enumeration of the minimal separators and maximal cliques, which means that the ordering it produces is special.

We present an ordering which generalizes a LexBFS-type ordering, by eliminating at each step a set of simplicial vertices (called a moplex). This type of ordering actually characterizes triangulated graphs and easily yields the minimal separators and maximal cliques.

We establish a strong relationship between moplex elimination orderings and clique trees. We also extend our results to the problem of embedding an arbitrary graph into a triangulated graph by showing that this process of computing a minimal triangulation is essentially equivalent to forcing a graph into having a simplicial moplex elimination ordering

References (10)

  • A. Berry et al.

    Separability generalizes Dirac's theorem

    Discrete Applied Mathematics

    (1998)
  • A. Berry., A wide-range efficient algorithm for minimal triangulation. In Proceedings of...
  • A. Berry, J.-P. Bordat., Triangulated and Weakly triangulated graphs: simpliciality in vertices and edges....
  • J.R.S. Blair et al.

    An introduction to chordal graphs and clique trees. Graph Theory and Sparse Matrix Computations

There are more references available in the full text version of this article.

Cited by (0)

View full text