Almost spanning subgraphs of random graphs after adversarial edge removal (2009)
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
ABNT
BÖTTCHER, Julia e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2009.11.055. Acesso em: 18 ago. 2024. , 2009APA
Böttcher, J., Kohayakawa, Y., & Taraz, A. (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2009.11.055NLM
Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055Vancouver
Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055