C. Anstegui, J. Girldez, and J. Levy, The community structure of sat formulas, SAT, 2012.

C. Anstegui and J. Levy, On the modularity of industrial sat instances, CCIA, 2011.

A. Braunstein, M. Mézard, and R. Zecchina, Survey propagation: An algorithm for satisfiability, Random Structures & Algorithms, vol.27, pp.201-226, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00008893

M. Davis, G. Logemann, and D. Loveland, A machine program for theoremproving, Communication of ACM, vol.5, issue.7, pp.394-397, 1962.

A. Langville and C. Meyer, Google's PageRank and Beyond: The Science of Search Engine Rankings, 2006.

D. Shah and T. Zaman, Community detection in networks: The leader-follower algorithm, 2010.

J. Silva and K. Sakallah, Grasp -a new search algorithm for satisfiability, ICCAD, pp.220-227, 1996.

T. Walsh, Search in a small world, IJCAI '99: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp.1172-1177, 1999.

L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, Efficient conflict driven learning in a boolean satisfiability solver, Proceedings of IEEE/ACM International Conference on Computer Design (ICCAD), pp.279-285, 2001.