Title of article
Lex M versus MCS-M Original Research Article
Author/Authors
Yngve Villanger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
393
To page
400
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 , MCS-M , Lex M
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948191
Link To Document