Filtros : "Financiamento NSF" "Latin American Symposium on Theoretical Informatics - LATIN" Removidos: "QUIMICA FUNDAMENTAL" "MCM" "ARQUITETURA" "FFCLRP-592" "HRAC" Limpar

Filtros



Refine with date range


  • Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 09 jul. 2024.
    • APA

      Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
    • NLM

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
    • Vancouver

      Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024