Connectivity for a modified binomial random graph by agglomeration (2014)
Fonte: Proceedings. Nome do evento: International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms - AofA. Unidade: ICMC
Assuntos: PROBABILIDADE, INFERÊNCIA ESTATÍSTICA, PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KANG, Mihyun e PACHÓN, Angelica e RODRÍGUEZ, Pablo Martín. Connectivity for a modified binomial random graph by agglomeration. 2014, Anais.. Nancy, France: Discrete Mathematics and Theoretical Computer Science (DMTCS), 2014. . Acesso em: 09 nov. 2025.APA
Kang, M., Pachón, A., & Rodríguez, P. M. (2014). Connectivity for a modified binomial random graph by agglomeration. In Proceedings. Nancy, France: Discrete Mathematics and Theoretical Computer Science (DMTCS).NLM
Kang M, Pachón A, Rodríguez PM. Connectivity for a modified binomial random graph by agglomeration. Proceedings. 2014 ;[citado 2025 nov. 09 ]Vancouver
Kang M, Pachón A, Rodríguez PM. Connectivity for a modified binomial random graph by agglomeration. Proceedings. 2014 ;[citado 2025 nov. 09 ]
