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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Computer Science and Engineering
Paper Title
Journal
Date
