Buscar
Mostrando ítems 1-1 de 1
Conectividade do grafo aleatório de Erdös-Rényi e uma variante com conexões locais
(Universidade Federal de São Carlos, 2016-03-24)
We say that a graph is connected if there is a path edges between any pair of vertices.
Random graph Erd os-R enyi with n vertices is obtained by connecting each pair of vertex with probability pn 2 (0; 1) independently ...