First, we evaluated the computation time for our proposed algorithm to enumerate all maximum cliques in the modular product of a chemical reaction with a success probability over 0.99. We conducted a comparative analysis with a well-established exact maximum clique enumeration algorithm introduced by Carraghan and Pardalos, called CP-exact algorithm. The performance was evaluated by measuring the average computation time over 10 iterations for enumerating the maximum cliques in each corresponding chemical reaction.