Elsevier

Discrete Mathematics

Volume 306, Issue 3, 28 February 2006, Pages 393-400
Discrete Mathematics

Lex M versus MCS-M

https://doi.org/10.1016/j.disc.2005.12.005Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M called MCS-M, was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of triangulations, answering an open question mentioned by the authors of MCS-M.

Keywords

Chordal graph
Minimal triangulation
Elimination ordering
Lex M
MCS-M

Cited by (0)