S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics, vol.23, issue.1, pp.11-24, 1989.
DOI : 10.1016/0166-218X(89)90031-0

D. Balcan and A. Erzan, Dynamics of Content-Based Networks, ICCS 2006, pp.1083-1090, 2006.
DOI : 10.1007/11758532_148

U. Banerjee, Data dependence in ordinary programs Master's thesis, 1976.

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

M. Barbut and B. Monjardet, Ordre et classification. Hachette, 1970.

A. Bhan, D. J. Galas, and T. G. Dewey, A duplication growth model of gene expression networks, Bioinformatics, vol.18, issue.11, pp.1486-1493, 2002.
DOI : 10.1093/bioinformatics/18.11.1486

L. Hans and . Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, pp.1305-1317, 1996.

M. Choudhury, N. Ganguly, A. Maiti, A. Mukherjee, L. Brusch et al., Modeling discrete combinatorial systems as alphabetic bipartite networks: Theory and applications, Physical Review E, vol.81, issue.3, p.36103, 2010.
DOI : 10.1103/PhysRevE.81.036103

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

E. De, S. , and M. P. Stumpf, Complex networks and simple models in biology, J. R. Soc. Interface, vol.2, issue.2, pp.419-4305, 2005.

S. N. Dorogovtsev and J. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW, 2003.

L. B. Doyle, Indexing and abstracting by association American Documentation, pp.378-390, 1962.

P. Erd?-os and A. Rényi, On the evolution of random graphs, Madyar Tnd. Akad. Mat. Kut. Int. K? ozl, vol.6, pp.17-61, 1960.

D. Fenn, O. Suleman, J. Efstathiou, and N. F. Johnson, How does Europe make its mind up? Connections, cliques, and compatibility between countries in the Eurovision Song Contest. Physica A: Statistical Mechanics and its Applications, pp.576-5980505071, 2006.

J. Ferrante, K. J. Ottenstein, and J. D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, vol.9, issue.3, pp.319-349, 1987.
DOI : 10.1145/24039.24041

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835

G. Ghoshal, V. Zlati´czlati´c, G. Caldarelli, and M. E. Newman, Random hypergraphs and their applications, Physical Review E, vol.79, issue.6, p.66118, 2009.
DOI : 10.1103/PhysRevE.79.066118

J. Guillaume and M. Latapy, Bipartite structure of all complex networks, Information Processing Letters, vol.90, issue.5, pp.215-221, 2004.
DOI : 10.1016/j.ipl.2004.03.007

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

J. Gustedt, Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient, International Workshop on Complex Networks, vol.207, pp.99-113, 2009.
DOI : 10.1007/978-3-642-01206-8_9

URL : https://hal.archives-ouvertes.fr/inria-00312059

J. Gustedt and P. Schimit, Numerical results for generalized attachment models for the genesis of graphs. Rapport technique, INRIA, p.361, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00349461

F. Hormozdiari, P. Berenbrink, N. Pr?ulj, and S. Sahinalp, Not All Scale-Free Networks Are Born Equal: The Role of the Seed Graph in PPI Network Evolution, PLoS Computational Biology, vol.6, issue.7
DOI : 10.1371/journal.pcbi.0030118.sd002

H. Jeong, B. Tombor, Z. N. Albert, R. Oltvai, and A. L. Barabási, The large-scale organization of metabolic networks, Nature, issue.6804, p.407

P. L. Krapivsky and S. Redner, Network growth by copying, Physical Review E, vol.71, issue.3, p.36118, 2005.
DOI : 10.1103/PhysRevE.71.036118

R. Lambiotte and M. Ausloos, -body decomposition of bipartite author networks, Physical Review E, vol.72, issue.6, p.66117, 2005.
DOI : 10.1103/PhysRevE.72.066117

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

R. Lambiotte and M. Ausloos, Uncovering collective listening habits and music genres in bipartite networks, Physical Review E, vol.72, issue.6, p.720508233, 2005.
DOI : 10.1103/PhysRevE.72.066107

M. Latapy, Grands graphes de terrain ? mesure et métrologie, analyse, modélisation, algorithmique. HabilitationàHabilitation`Habilitationà diriger des recherches, 2007.

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, issue.1, p.16132, 2001.
DOI : 10.1103/PhysRevE.64.016132

M. E. Newman, Scientific collaboration networks.??????I. Network construction and fundamental results, Physical Review E, vol.64, issue.1, p.16131, 2001.
DOI : 10.1103/PhysRevE.64.016131

M. E. Newman, Erratum, Phys. Rev. E, vol.64, issue.733, p.016132039906, 2001.
DOI : 10.1007/978-3-662-30748-9_15

URL : https://hal.archives-ouvertes.fr/in2p3-00400337

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

T. Nishizeki, K. Takamizawa, and N. Saito, Algorithms for detecting seriesparallel graphs and D-charts, Trans. Inst. Elect. Commun. Eng. Japan, vol.59, issue.3, pp.259-260, 1976.

M. Patel, J. Bullinaria, and J. Levy, Extracting Semantic Representations from Large Text Corpora, Proceedings of the 4th Neural Computation and Psychology Workshop, pp.199-212, 1997.
DOI : 10.1007/978-1-4471-1546-5_16

J. José, M. Ramasco, and . Mungan, Inversion method for content-based networks, Phys. Rev. E, vol.77, issue.3, p.36122, 2008.

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

M. Thorup, All Structured Programs Have Small Tree Width and Good Register Allocation, Information and Computation, vol.142, issue.2, pp.159-181, 1998.
DOI : 10.1006/inco.1997.2697

A. Wagner, Evolution of gene networks by gene duplications: a mathematical model and its implications on genome organization., Proc. Natl. Acad
DOI : 10.1073/pnas.91.10.4387

I. Inria-centre-de-recherche, I. Nancy, ?. Est, and L. , Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès