W. Aiello, F. Chung, and L. Lu, Random evolution in massive graphs, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp.510-519, 2001.

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

H. Leo-bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

D. Cheriton and R. E. Tarjan, Finding Minimum Spanning Trees, SIAM Journal on Computing, vol.5, issue.4, pp.724-742, 1976.
DOI : 10.1137/0205051

F. K. Dehne, W. Dittrich, and D. Hutchinson, Efficient external memory algorithms by simulating coarse-grained parallel algorithms, ACM Symposium on Parallel Algorithms and Architectures, pp.106-115, 1997.
DOI : 10.1145/258492.258503
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5743

C. Fiorio and J. Gustedt, Two linear time Union-Find strategies for image processing, Theoretical Computer Science, vol.154, issue.2, pp.165-181, 1996.
DOI : 10.1016/0304-3975(94)00262-2
URL : https://hal.archives-ouvertes.fr/inria-00549539

S. Fortune and J. Wyllie, Parallelism in random access machines, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.114-118, 1978.
DOI : 10.1145/800133.804339

I. G. Assefaw-hadish-gebremedhin, J. Lassous, J. A. Gustedt, and . Telle, PRO: a model for parallel resource-optimal computation, 16th Annual International Symposium on High Performance Computing Systems and Applications, pp.106-113, 2002.

J. Gustedt, Minimum spanning trees for minor-closed graph classes in parallel, Symposium on Theoretical Aspects of Computer Science, pp.421-431, 1998.
DOI : 10.1007/BFb0028578
URL : https://hal.archives-ouvertes.fr/inria-00549659

J. Gustedt, Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm, International Conference on Computational Science and its Applications (ICCSA 2003), part II, number 2668 in LNCS, pp.269-278, 2003.
DOI : 10.1007/3-540-44843-8_29
URL : https://hal.archives-ouvertes.fr/inria-00099787

S. Kannan, M. Naor, and S. Rudich, Implicit representation of graphs, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.596-603, 1992.
DOI : 10.1145/62212.62244

M. Latapy and P. Pons, Computing communities in large networks using random walks, ISCIS'05, pp.284-293, 2005.

W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Mathematische Annalen, vol.153, issue.215, pp.265-268, 1967.
DOI : 10.1007/BF01364272
URL : http://www.digizeitschriften.de/download/PPN235181684_0174/PPN235181684_0174___log64.pdf

C. St and . John-alvah-nash-williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc, vol.36, issue.2, pp.445-450, 1961.

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181