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.
The McSplit algorithm, in both its original and improved forms (McSplitDAL+PR), outperforms clique encoding for many graph types.  McSplitDAL+PR uses a combination of reinforcement learning and PageRank to enhance efficiency.