Eliminate Order Algorithm in the Chain Graph Model

Abstract

In the variable elimination algorithm of chain graph model, different elimination order lead to different computational efficiency, combining Maximum Cardinality Search (MCS) and Lexicographic Breadth First Search, Variant Minimal (Lex-M) algorithm. This paper gets an algorithm of searching to eliminate order in the chain graph model, namely Maximum Cardinality Search, Variant Minimal (MCS-M).