The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs.
I. Dhillon, Y. Guan, and B. Kulis. KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, page 629--634. New York, NY, USA, ACM Press, (2005)
J. Ganascia, and J. Velcin. Proceedings of the 12th International Conference on Conceptual Structures (ICCS 2004), volume 3127 of Lecture Notes in Computer Science, page 156-169. Springer, (2004)
M. y Gómez, A. Gelbukh, and A. López-López. Proceedings of the 10th International Conference on Conceptual Structures (ICCS 2002), volume 2393 of Lecture Notes in Computer Science, page 122-136. Springer, (2002)
G. Jeh, and J. Widom. KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, page 538--543. New York, NY, USA, ACM, (2002)