Filtros : "GRAFOS ALEATÓRIOS" "Indexado no MathSciNet" Removido: "IEEE Transactions on Network Science and Engineering" Limpar

Filtros



Refine with date range


  • Source: Physical Review E. Unidade: ICMC

    Subjects: GRAFOS ALEATÓRIOS, HEURÍSTICA, DISTRIBUIÇÕES (PROBABILIDADE)

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

      MARTÍNEZ-MARTÍNEZ, Claudia Teresa et al. Nonuniform random graphs on the plane: a scaling study. Physical Review E, v. 105, n. 3, p. 034304-1, 2022Tradução . . Disponível em: https://doi.org/10.1103/PhysRevE.105.034304. Acesso em: 27 nov. 2025.
    • APA

      Martínez-Martínez, C. T., Méndez-Bermúdez, J. A., Rodrigues, F. A., & Estrada, E. (2022). Nonuniform random graphs on the plane: a scaling study. Physical Review E, 105( 3), 034304-1. doi:10.1103/PhysRevE.105.034304
    • NLM

      Martínez-Martínez CT, Méndez-Bermúdez JA, Rodrigues FA, Estrada E. Nonuniform random graphs on the plane: a scaling study [Internet]. Physical Review E. 2022 ; 105( 3): 034304-1.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1103/PhysRevE.105.034304
    • Vancouver

      Martínez-Martínez CT, Méndez-Bermúdez JA, Rodrigues FA, Estrada E. Nonuniform random graphs on the plane: a scaling study [Internet]. Physical Review E. 2022 ; 105( 3): 034304-1.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1103/PhysRevE.105.034304
  • Source: Journal of the European Mathematical Society. Unidade: ICMC

    Subjects: TEORIA ERGÓDICA, GRAFOS ALEATÓRIOS

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

      PEREIRA, Tiago e STRIEN, Sebastian van e TANZI, Matteo. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers. Journal of the European Mathematical Society, v. 22, n. 7, p. 2183–2252, 2020Tradução . . Disponível em: https://doi.org/10.4171/JEMS/963. Acesso em: 27 nov. 2025.
    • APA

      Pereira, T., Strien, S. van, & Tanzi, M. (2020). Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers. Journal of the European Mathematical Society, 22( 7), 2183–2252. doi:10.4171/JEMS/963
    • NLM

      Pereira T, Strien S van, Tanzi M. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers [Internet]. Journal of the European Mathematical Society. 2020 ; 22( 7): 2183–2252.[citado 2025 nov. 27 ] Available from: https://doi.org/10.4171/JEMS/963
    • Vancouver

      Pereira T, Strien S van, Tanzi M. Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers [Internet]. Journal of the European Mathematical Society. 2020 ; 22( 7): 2183–2252.[citado 2025 nov. 27 ] Available from: https://doi.org/10.4171/JEMS/963
  • Source: European Journal of Combinatorics. Unidade: IME

    Subjects: TEORIA DOS CONJUNTOS, LÓGICA COMBINATÓRIA, COMBINATÓRIA, GRAFOS ALEATÓRIOS

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

      FRANKL, Peter e KOHAYAKAWA, Yoshiharu e RODL, Vojtech. A note on supersaturated set systems. European Journal of Combinatorics, v. 51, n. Ja 2016, p. 190-199, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2015.03.028. Acesso em: 27 nov. 2025.
    • APA

      Frankl, P., Kohayakawa, Y., & Rodl, V. (2016). A note on supersaturated set systems. European Journal of Combinatorics, 51( Ja 2016), 190-199. doi:10.1016/j.ejc.2015.03.028
    • NLM

      Frankl P, Kohayakawa Y, Rodl V. A note on supersaturated set systems [Internet]. European Journal of Combinatorics. 2016 ; 51( Ja 2016): 190-199.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejc.2015.03.028
    • Vancouver

      Frankl P, Kohayakawa Y, Rodl V. A note on supersaturated set systems [Internet]. European Journal of Combinatorics. 2016 ; 51( Ja 2016): 190-199.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejc.2015.03.028
  • Source: SIAM Journal on Discrete Mathematics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS

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

      BOETTCHER, Julia et al. An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, v. 29, n. 2, p. 962-1001, 2015Tradução . . Disponível em: https://doi.org/10.1137/13093827X. Acesso em: 27 nov. 2025.
    • APA

      Boettcher, J., Kohayakawa, Y., Taraz, A., & Wuerfl, A. (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29( 2), 962-1001. doi:10.1137/13093827X
    • NLM

      Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1137/13093827X
    • Vancouver

      Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1137/13093827X
  • Source: Electronic Journal of Combinatorics. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS

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

      ALLEN, Peter et al. On the number of orientations of random graphs with no directed cycles of a given length. Electronic Journal of Combinatorics, v. 21, n. 1, 2014Tradução . . Disponível em: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf. Acesso em: 27 nov. 2025.
    • APA

      Allen, P., Kohayakawa, Y., Mota, G. O., & Parente, R. F. (2014). On the number of orientations of random graphs with no directed cycles of a given length. Electronic Journal of Combinatorics, 21( 1). Recuperado de http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
    • NLM

      Allen P, Kohayakawa Y, Mota GO, Parente RF. On the number of orientations of random graphs with no directed cycles of a given length [Internet]. Electronic Journal of Combinatorics. 2014 ; 21( 1):[citado 2025 nov. 27 ] Available from: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
    • Vancouver

      Allen P, Kohayakawa Y, Mota GO, Parente RF. On the number of orientations of random graphs with no directed cycles of a given length [Internet]. Electronic Journal of Combinatorics. 2014 ; 21( 1):[citado 2025 nov. 27 ] Available from: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
  • Source: European Journal of Combinatorics. Unidade: IME

    Subjects: COMBINATÓRIA, GRAFOS ALEATÓRIOS

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

      KOHAYAKAWA, Yoshiharu e KONSTADINIDIS, Pavlos B e MOTA, Guilherme Oliveira. On an anti-Ramsey threshold for random graphs. European Journal of Combinatorics, v. 40, p. 26-41, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2014.02.004. Acesso em: 27 nov. 2025.
    • APA

      Kohayakawa, Y., Konstadinidis, P. B., & Mota, G. O. (2014). On an anti-Ramsey threshold for random graphs. European Journal of Combinatorics, 40, 26-41. doi:10.1016/j.ejc.2014.02.004
    • NLM

      Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for random graphs [Internet]. European Journal of Combinatorics. 2014 ; 40 26-41.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejc.2014.02.004
    • Vancouver

      Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for random graphs [Internet]. European Journal of Combinatorics. 2014 ; 40 26-41.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1016/j.ejc.2014.02.004
  • Source: Random Structures & Algorithms. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, TEORIA DOS GRAFOS, COMBINATÓRIA

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

      KOHAYAKAWA, Yoshiharu e SCHACHT, Mathias e SPÖHEL, Reto. Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Structures & Algorithms, v. 44, n. 1, p. 1-28, 2014Tradução . . Disponível em: https://doi.org/10.1002/rsa.20446. Acesso em: 27 nov. 2025.
    • APA

      Kohayakawa, Y., Schacht, M., & Spöhel, R. (2014). Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Structures & Algorithms, 44( 1), 1-28. doi:10.1002/rsa.20446
    • NLM

      Kohayakawa Y, Schacht M, Spöhel R. Upper bounds on probability thresholds for asymmetric Ramsey properties [Internet]. Random Structures & Algorithms. 2014 ; 44( 1): 1-28.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20446
    • Vancouver

      Kohayakawa Y, Schacht M, Spöhel R. Upper bounds on probability thresholds for asymmetric Ramsey properties [Internet]. Random Structures & Algorithms. 2014 ; 44( 1): 1-28.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20446

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