Both versions of the McSplit algorithm outperform the clique encoding for many graph classes.A more efficient implementation of McSplit is McSplitDAL+PR, which combines a Reinforcement Learning agent with some heuristic scores computed with the PageRank algorithm.
Both versions of the McSplit algorithm are more efficient than clique encoding, particularly in terms of performance on various graph classes. McSplitDAL+PR is an enhanced version of McSplit that incorporates both reinforcement learning and PageRank for improved results.