D. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature, vol.393, issue.6684, pp.440-442, 1998.
DOI : 10.1038/30918

M. Newman, S. Strogatz, and D. Watts, Random graphs with arbitrary degree distributions and their applications, Physical Review E, vol.64, issue.2, 2001.
DOI : 10.1103/PhysRevE.64.026118

M. Newman, D. Watts, and S. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences, vol.99, issue.Supplement 1, pp.2566-2572, 2002.
DOI : 10.1073/pnas.012582999

D. Bourcier and P. Mazzega, Codification law article and graphs, Legal Knowledge and Information Systems, pp.29-38, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00325702

R. Boulet, P. Mazzega, and D. Bourcier, A network approach to the French system of legal codes???part I: analysis of a dense network, Artificial Intelligence and Law, vol.8, issue.3, pp.333-355, 2011.
DOI : 10.1007/s10506-011-9116-1

URL : https://hal.archives-ouvertes.fr/hal-00642894

J. Guillaume and M. Latapy, Bipartite graphs as Models of Complex Networks, pp.795-813, 2004.

M. Latapy, C. Magnien, and N. D. Vecchio, Basic notions for the analysis of large two-mode networks, Social Networks, vol.30, issue.1, pp.31-48, 2008.
DOI : 10.1016/j.socnet.2007.04.006

URL : https://hal.archives-ouvertes.fr/hal-01146080

Y. Ahn, S. E. Ahnert, J. P. Bagrow, and A. Barabási, Flavor network and the principles of food pairing, Scientific Reports, vol.5, issue.1, 2011.
DOI : 10.1371/journal.pone.0011233

F. Tarissan, B. Quoitin, P. Mérindol, B. Donnet, M. Latapy et al., Towards a bipartite graph modeling of the internet topology, Computer Networks, vol.57, issue.11, pp.2331-2347, 2013.
DOI : 10.1016/j.comnet.2013.04.007

URL : https://hal.archives-ouvertes.fr/hal-01146087

S. Mangan, S. Itzkovitz, A. Zaslaver, and U. Alon, The Incoherent Feed-forward Loop Accelerates the Response-time of the gal System of Escherichia coli, Journal of Molecular Biology, vol.356, issue.5, pp.1073-1081, 2006.
DOI : 10.1016/j.jmb.2005.12.003

S. Mangan and U. Alon, Structure and function of the feed-forward loop network motif, Proceedings of the National Academy of Sciences, vol.100, issue.21, pp.11980-11985, 2003.
DOI : 10.1073/pnas.2133841100

T. Schank and D. Wagner, Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study, Workshop on Experimental and Efficient Algorithms (WEA), 2005.
DOI : 10.1007/11427186_54

T. Schank and D. Wagner, Approximating Clustering Coefficient and Transitivity, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.265-275, 2005.
DOI : 10.7155/jgaa.00108