Menu

Filtros : "TEORIA DOS GRAFOS" "Inglês" Limpar

Filtros

Refine with date range

1 - 20 (355 records)

  • Trabalho de evento

    Separating path systems in complete graphs (2024)

    Fernandes, Cristina Gomes ; Mota, Guilherme Oliveira ; Sanhueza-Matamala, Nicolás

    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

      FERNANDES, Cristina Gomes e MOTA, Guilherme Oliveira e SANHUEZA-MATAMALA, Nicolás. Separating path systems in complete graphs. 2024, Anais.. Cham: Springer, 2024. Disponível em: https://doi.org/10.1007/978-3-031-55601-2_7. Acesso em: 11 nov. 2024.

    • APA

      Fernandes, C. G., Mota, G. O., & Sanhueza-Matamala, N. (2024). Separating path systems in complete graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-55601-2_7

    • NLM

      Fernandes CG, Mota GO, Sanhueza-Matamala N. Separating path systems in complete graphs [Internet]. Proceedings. 2024 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-55601-2_7

    • Vancouver

      Fernandes CG, Mota GO, Sanhueza-Matamala N. Separating path systems in complete graphs [Internet]. Proceedings. 2024 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-55601-2_7

  • Dissertação (Mestrado)

    Problem-solving techniques in infinite graphs (2024)

    Real, Lucas Silva Sinzato ; Aurichi, Leandro Fiorini (Orientador)

    Unidade: ICMC

    Subjects: TEORIA DOS GRAFOS, TEORIA DOS CONJUNTOS, TOPOLOGIA

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

    • ABNT

      REAL, Lucas Silva Sinzato. Problem-solving techniques in infinite graphs. 2024. Dissertação (Mestrado) – Universidade de São Paulo, São Carlos, 2024. Disponível em: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-161415/. Acesso em: 11 nov. 2024.

    • APA

      Real, L. S. S. (2024). Problem-solving techniques in infinite graphs (Dissertação (Mestrado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-161415/

    • NLM

      Real LSS. Problem-solving techniques in infinite graphs [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-161415/

    • Vancouver

      Real LSS. Problem-solving techniques in infinite graphs [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-161415/

  • Artigo de periodico

    On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments (2024)

    Alves, Caroline Lourenço ; Ciba, Manuel ; Toutain, Thaise Graziele Lima de ; Porto, Joel Augusto Moura ; Sena, Eduardo Pondé de ; Thielemann, Christiane ; Rodrigues, Francisco

    Source: Journal of Physics: Complexity. Unidades: ICMC, IFSC

    Subjects: VISÃO COMPUTACIONAL, APRENDIZADO COMPUTACIONAL, TOPOLOGIA EM COMPUTAÇÃO, REDES NEURAIS, TEORIA DOS GRAFOS, CÓRTEX CEREBRAL (ANÁLISE), CÉREBRO (ANÁLISE;ESTUDO)

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

    • ABNT

      ALVES, Caroline Lourenço et al. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments. Journal of Physics: Complexity, v. 5, n. Ja 2024, p. 015002-1-015002-23, 2024Tradução . . Disponível em: https://doi.org/10.1088/2632-072X/ad1c68. Acesso em: 11 nov. 2024.

    • APA

      Alves, C. L., Ciba, M., Toutain, T. G. L. de, Porto, J. A. M., Sena, E. P. de, Thielemann, C., & Rodrigues, F. (2024). On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments. Journal of Physics: Complexity, 5( Ja 2024), 015002-1-015002-23. doi:10.1088/2632-072X/ad1c68

    • NLM

      Alves CL, Ciba M, Toutain TGL de, Porto JAM, Sena EP de, Thielemann C, Rodrigues F. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments [Internet]. Journal of Physics: Complexity. 2024 ; 5( Ja 2024): 015002-1-015002-23.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1088/2632-072X/ad1c68

    • Vancouver

      Alves CL, Ciba M, Toutain TGL de, Porto JAM, Sena EP de, Thielemann C, Rodrigues F. On the advances in machine learning and complex network measures to an EEG dataset from DMT experiments [Internet]. Journal of Physics: Complexity. 2024 ; 5( Ja 2024): 015002-1-015002-23.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1088/2632-072X/ad1c68

  • Artigo de periodico

    Unsupervised heterogeneous graph neural networks for one-class tasks: exploring early fusion operators (2024)

    Gôlo, Marcos Paulo Silva ; Moraes Junior, Marcelo Isaias de ; Goularte, Rudinei ; Marcacini, Ricardo Marcondes

    Source: Journal on Interactive Systems. Unidade: ICMC

    Subjects: REDES NEURAIS, TEORIA DOS GRAFOS

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

    • ABNT

      GÔLO, Marcos Paulo Silva et al. Unsupervised heterogeneous graph neural networks for one-class tasks: exploring early fusion operators. Journal on Interactive Systems, v. 15, n. 1, p. 517-529, 2024Tradução . . Disponível em: https://doi.org/10.5753/jis.2024.4109. Acesso em: 11 nov. 2024.

    • APA

      Gôlo, M. P. S., Moraes Junior, M. I. de, Goularte, R., & Marcacini, R. M. (2024). Unsupervised heterogeneous graph neural networks for one-class tasks: exploring early fusion operators. Journal on Interactive Systems, 15( 1), 517-529. doi:10.5753/jis.2024.4109

    • NLM

      Gôlo MPS, Moraes Junior MI de, Goularte R, Marcacini RM. Unsupervised heterogeneous graph neural networks for one-class tasks: exploring early fusion operators [Internet]. Journal on Interactive Systems. 2024 ; 15( 1): 517-529.[citado 2024 nov. 11 ] Available from: https://doi.org/10.5753/jis.2024.4109

    • Vancouver

      Gôlo MPS, Moraes Junior MI de, Goularte R, Marcacini RM. Unsupervised heterogeneous graph neural networks for one-class tasks: exploring early fusion operators [Internet]. Journal on Interactive Systems. 2024 ; 15( 1): 517-529.[citado 2024 nov. 11 ] Available from: https://doi.org/10.5753/jis.2024.4109

  • Tese (Doutorado)

    Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis (2024)

    Baldo, Heitor; Fujita, André (coorient) ; Sameshima, Koichi (Orientador)

    Unidade: BIOINFORMÁTICA

    Subjects: ELETROENCEFALOGRAFIA, EPILEPSIA, TEORIA DOS GRAFOS

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

    • ABNT

      BALDO, Heitor. Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis. 2024. Tese (Doutorado) – Universidade de São Paulo, São Paulo, 2024. Disponível em: https://www.teses.usp.br/teses/disponiveis/95/95131/tde-04072024-124243/. Acesso em: 11 nov. 2024.

    • APA

      Baldo, H. (2024). Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis (Tese (Doutorado). Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/95/95131/tde-04072024-124243/

    • NLM

      Baldo H. Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/95/95131/tde-04072024-124243/

    • Vancouver

      Baldo H. Towards a Quantitative Theory of Digraph-Based Complexes and its Applications in Brain Network Analysis [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/95/95131/tde-04072024-124243/

  • Trabalho de evento

    Modelling graph neural network by aggregating the activation maps of self-organizing map (2024)

    Martins, Luan Vinicius de Carvalho ; Donghong, Ji; Liang, Zhao

    Source: Proceedings. Conference titles: International Joint Conference on Neural Networks - IJCNN. Unidades: FFCLRP, ICMC

    Subjects: REDES NEURAIS, TEORIA DOS GRAFOS

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

    • ABNT

      MARTINS, Luan Vinicius de Carvalho e DONGHONG, Ji e LIANG, Zhao. Modelling graph neural network by aggregating the activation maps of self-organizing map. 2024, Anais.. Piscataway: IEEE, 2024. Disponível em: https://doi.org/10.1109/IJCNN60899.2024.10650514. Acesso em: 11 nov. 2024.

    • APA

      Martins, L. V. de C., Donghong, J., & Liang, Z. (2024). Modelling graph neural network by aggregating the activation maps of self-organizing map. In Proceedings. Piscataway: IEEE. doi:10.1109/IJCNN60899.2024.10650514

    • NLM

      Martins LV de C, Donghong J, Liang Z. Modelling graph neural network by aggregating the activation maps of self-organizing map [Internet]. Proceedings. 2024 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.1109/IJCNN60899.2024.10650514

    • Vancouver

      Martins LV de C, Donghong J, Liang Z. Modelling graph neural network by aggregating the activation maps of self-organizing map [Internet]. Proceedings. 2024 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.1109/IJCNN60899.2024.10650514

  • Artigo de periodico

    On the anti-Ramsey threshold for non-balanced graphs (2024)

    Araújo, Pedro; Martins, Taísa ; Mattos, Letícia; Mendonça, Walner ; Moreira, Luiz; Mota, Guilherme Oliveira

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, TEORIA DE RAMSEY

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

    • ABNT

      ARAÚJO, Pedro et al. On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, v. 31, n. 1, p. 1-21, 2024Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70. Acesso em: 11 nov. 2024.

    • APA

      Araújo, P., Martins, T., Mattos, L., Mendonça, W., Moreira, L., & Mota, G. O. (2024). On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, 31( 1), 1-21. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70

    • NLM

      Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 nov. 11 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70

    • Vancouver

      Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2024 nov. 11 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70

  • Trabalho de evento-anais periodico

    Geolocalized transductive graph-based regression applied to sustainability indicators prediction (2024)

    Nespolo, Renan Guilherme ; Valejo, Alan Demetrius Baria ; Lopes, Alneu de Andrade

    Source: Lecture Notes in Networks and Systems. Conference titles: International Conference on Intelligent Systems Design and Applications - ISDA. Unidade: ICMC

    Subjects: APRENDIZADO COMPUTACIONAL, PREVISÃO (ANÁLISE DE SÉRIES TEMPORAIS), TEORIA DOS GRAFOS, REGRESSÃO LINEAR, SUSTENTABILIDADE

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

    • ABNT

      NESPOLO, Renan Guilherme e VALEJO, Alan Demetrius Baria e LOPES, Alneu de Andrade. Geolocalized transductive graph-based regression applied to sustainability indicators prediction. Lecture Notes in Networks and Systems. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-031-64847-2_44. Acesso em: 11 nov. 2024. , 2024

    • APA

      Nespolo, R. G., Valejo, A. D. B., & Lopes, A. de A. (2024). Geolocalized transductive graph-based regression applied to sustainability indicators prediction. Lecture Notes in Networks and Systems. Cham: Springer. doi:10.1007/978-3-031-64847-2_44

    • NLM

      Nespolo RG, Valejo ADB, Lopes A de A. Geolocalized transductive graph-based regression applied to sustainability indicators prediction [Internet]. Lecture Notes in Networks and Systems. 2024 ; 1050 471-482.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-64847-2_44

    • Vancouver

      Nespolo RG, Valejo ADB, Lopes A de A. Geolocalized transductive graph-based regression applied to sustainability indicators prediction [Internet]. Lecture Notes in Networks and Systems. 2024 ; 1050 471-482.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-64847-2_44

  • Tese (Doutorado)

    The graph representation problem for the investigation of synchronies in networks (2024)

    Amorim, Tiago de Albuquerque ; Manoel, Miriam Garcia (Orientador)

    Unidade: ICMC

    Subjects: TEORIA DAS SINGULARIDADES, SINGULARIDADES, SIMETRIA, TEORIA DOS GRAFOS

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

    • ABNT

      AMORIM, Tiago de Albuquerque. The graph representation problem for the investigation of synchronies in networks. 2024. Tese (Doutorado) – Universidade de São Paulo, São Carlos, 2024. Disponível em: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-140535/. Acesso em: 11 nov. 2024.

    • APA

      Amorim, T. de A. (2024). The graph representation problem for the investigation of synchronies in networks (Tese (Doutorado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-140535/

    • NLM

      Amorim T de A. The graph representation problem for the investigation of synchronies in networks [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-140535/

    • Vancouver

      Amorim T de A. The graph representation problem for the investigation of synchronies in networks [Internet]. 2024 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55135/tde-14052024-140535/

  • Artigo de periodico

    Density of identifying codes of hexagonal grids with finite number of rows (2024)

    Sampaio, Rudini Menezes ; Sobral, Gabriel Augusto Gonçalves ; Wakabayashi, Yoshiko

    Source: RAIRO - Operations Research. Unidades: IME, BIOINFORMÁTICA

    Subjects: TEORIA DA INFORMAÇÃO, TEORIA DA COMUNICAÇÃO, TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

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

    • ABNT

      SAMPAIO, Rudini Menezes e SOBRAL, Gabriel Augusto Gonçalves e WAKABAYASHI, Yoshiko. Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, v. 58, n. 2, p. 1633-1651, 2024Tradução . . Disponível em: https://doi.org/10.1051/ro/2024046. Acesso em: 11 nov. 2024.

    • APA

      Sampaio, R. M., Sobral, G. A. G., & Wakabayashi, Y. (2024). Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, 58( 2), 1633-1651. doi:10.1051/ro/2024046

    • NLM

      Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1051/ro/2024046

    • Vancouver

      Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1051/ro/2024046

  • Artigo de periodico

    Evaluating brain group structure methods using hierarchical dynamic models (2024)

    Costa, Lilia ; Anacleto, Osvaldo ; Nascimento, Diego Carvalho ; Smith, James Q; Queen, Catriona M; Louzada, Francisco ; Nichols, Thomas

    Source: Pattern Recognition. Unidade: ICMC

    Subjects: TEORIA DOS GRAFOS, ESTUDO DE CASO, MAPEAMENTO CEREBRAL

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

    • ABNT

      COSTA, Lilia et al. Evaluating brain group structure methods using hierarchical dynamic models. Pattern Recognition, v. 155, p. 1-13, 2024Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2024.110687. Acesso em: 11 nov. 2024.

    • APA

      Costa, L., Anacleto, O., Nascimento, D. C., Smith, J. Q., Queen, C. M., Louzada, F., & Nichols, T. (2024). Evaluating brain group structure methods using hierarchical dynamic models. Pattern Recognition, 155, 1-13. doi:10.1016/j.patcog.2024.110687

    • NLM

      Costa L, Anacleto O, Nascimento DC, Smith JQ, Queen CM, Louzada F, Nichols T. Evaluating brain group structure methods using hierarchical dynamic models [Internet]. Pattern Recognition. 2024 ; 155 1-13.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2024.110687

    • Vancouver

      Costa L, Anacleto O, Nascimento DC, Smith JQ, Queen CM, Louzada F, Nichols T. Evaluating brain group structure methods using hierarchical dynamic models [Internet]. Pattern Recognition. 2024 ; 155 1-13.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2024.110687

  • Artigo de periodico

    Independent dominating sets in planar triangulations (2024)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan

    Source: The Electronic Journal of Combinatorics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, v. 31, n. 2, p. 1-10, 2024Tradução . . Disponível em: https://doi.org/10.37236/12548. Acesso em: 11 nov. 2024.

    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2024). Independent dominating sets in planar triangulations. The Electronic Journal of Combinatorics, 31( 2), 1-10. doi:10.37236/12548

    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 nov. 11 ] Available from: https://doi.org/10.37236/12548

    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 2): 1-10.[citado 2024 nov. 11 ] Available from: https://doi.org/10.37236/12548

  • Trabalho de evento-anais periodico

    A study of transductive graph-based regression (2024)

    Nespolo, Renan Guilherme ; Valejo, Alan Demetrius Baria ; Lopes, Alneu de Andrade

    Source: Lecture Notes in Networks and Systems. Conference titles: International Conference on Intelligent Systems Design and Applications - ISDA. Unidade: ICMC

    Subjects: APRENDIZADO COMPUTACIONAL, TEORIA DOS GRAFOS, REGRESSÃO LINEAR

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

    • ABNT

      NESPOLO, Renan Guilherme e VALEJO, Alan Demetrius Baria e LOPES, Alneu de Andrade. A study of transductive graph-based regression. Lecture Notes in Networks and Systems. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-031-64836-6_34. Acesso em: 11 nov. 2024. , 2024

    • APA

      Nespolo, R. G., Valejo, A. D. B., & Lopes, A. de A. (2024). A study of transductive graph-based regression. Lecture Notes in Networks and Systems. Cham: Springer. doi:10.1007/978-3-031-64836-6_34

    • NLM

      Nespolo RG, Valejo ADB, Lopes A de A. A study of transductive graph-based regression [Internet]. Lecture Notes in Networks and Systems. 2024 ; 1047 350-359.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-64836-6_34

    • Vancouver

      Nespolo RG, Valejo ADB, Lopes A de A. A study of transductive graph-based regression [Internet]. Lecture Notes in Networks and Systems. 2024 ; 1047 350-359.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/978-3-031-64836-6_34

  • Artigo de periodico

    The mod k chromatic index of graphs is O(k) (2023)

    Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu

    Source: Journal of Graph Theory. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of graphs is O(k). Journal of Graph Theory, v. 102, n. 1, p. 197-200, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22866. Acesso em: 11 nov. 2024.

    • APA

      Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of graphs is O(k). Journal of Graph Theory, 102( 1), 197-200. doi:10.1002/jgt.22866

    • NLM

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1002/jgt.22866

    • Vancouver

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of graphs is O(k) [Internet]. Journal of Graph Theory. 2023 ; 102( 1): 197-200.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1002/jgt.22866

  • Artigo de periodico

    How heavy independent sets help to find arborescences with many leaves in DAGs (2023)

    Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri

    Source: Journal of Computer and System Sciences. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS, ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, v. 135, p. 158-174, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2023.02.006. Acesso em: 11 nov. 2024.

    • APA

      Fernandes, C. G., & Lintzmayer, C. N. (2023). How heavy independent sets help to find arborescences with many leaves in DAGs. Journal of Computer and System Sciences, 135, 158-174. doi:10.1016/j.jcss.2023.02.006

    • NLM

      Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006

    • Vancouver

      Fernandes CG, Lintzmayer CN. How heavy independent sets help to find arborescences with many leaves in DAGs [Internet]. Journal of Computer and System Sciences. 2023 ; 135 158-174.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006

  • Tese (Doutorado)

    Heterogeneous Graphs for Text Representation: An Integrated Approach with Language Models (2023)

    Santos, Brucce Neves dos ; Marcacini, Ricardo Marcondes (coorient) ; Rezende, Solange Oliveira (Orientador)

    Unidade: ICMC

    Subjects: APRENDIZADO COMPUTACIONAL, TEORIA DOS GRAFOS, PROCESSAMENTO DE LINGUAGEM NATURAL, SISTEMAS EMBUTIDOS, SISTEMAS DE RECOMENDAÇÃO, ANÁLISE DE TEXTO

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

    • ABNT

      SANTOS, Brucce Neves dos. Heterogeneous Graphs for Text Representation: An Integrated Approach with Language Models. 2023. Tese (Doutorado) – Universidade de São Paulo, São Carlos, 2023. Disponível em: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-25032024-112903/. Acesso em: 11 nov. 2024.

    • APA

      Santos, B. N. dos. (2023). Heterogeneous Graphs for Text Representation: An Integrated Approach with Language Models (Tese (Doutorado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/55/55134/tde-25032024-112903/

    • NLM

      Santos BN dos. Heterogeneous Graphs for Text Representation: An Integrated Approach with Language Models [Internet]. 2023 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-25032024-112903/

    • Vancouver

      Santos BN dos. Heterogeneous Graphs for Text Representation: An Integrated Approach with Language Models [Internet]. 2023 ;[citado 2024 nov. 11 ] Available from: https://www.teses.usp.br/teses/disponiveis/55/55134/tde-25032024-112903/

  • Artigo de periodico

    Estimating the effects of urban green regions in terms of diffusion (2023)

    Tokuda, Eric Keiji ; Arruda, Henrique Ferraz de ; Domingues, Guilherme Schimidt ; Costa, Luciano da Fontoura ; Shibata, Florence Alyssa Sakuma ; Cesar Junior, Roberto Marcondes ; Comin, Cesar Henrique

    Source: Environment and Planning B: urban analytics and city science. Unidades: IME, IFSC

    Subjects: ESPAÇOS VERDES, PROCESSOS DE DIFUSÃO, TEORIA DOS GRAFOS

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

    • ABNT

      TOKUDA, Eric Keiji et al. Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, v. 50, n. 4, p. 1023-1038, 2023Tradução . . Disponível em: https://doi.org/10.1177/23998083221131572. Acesso em: 11 nov. 2024.

    • APA

      Tokuda, E. K., Arruda, H. F. de, Domingues, G. S., Costa, L. da F., Shibata, F. A. S., Cesar Junior, R. M., & Comin, C. H. (2023). Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, 50( 4), 1023-1038. doi:10.1177/23998083221131572

    • NLM

      Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1177/23998083221131572

    • Vancouver

      Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1177/23998083221131572

  • Trabalho de evento

    Independent dominating sets in planar triangulations (2023)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan

    Source: Proceedings. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. Independent dominating sets in planar triangulations. 2023, Anais.. Prague: Charles University, 2023. Disponível em: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023. Acesso em: 11 nov. 2024.

    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2023). Independent dominating sets in planar triangulations. In Proceedings. Prague: Charles University. doi:10.5817/CZ.MUNI.EUROCOMB23-023

    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023

    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. Independent dominating sets in planar triangulations [Internet]. Proceedings. 2023 ;[citado 2024 nov. 11 ] Available from: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-023

  • Artigo de periodico

    The mod k chromatic index of random graphs (2023)

    Botler, Fábio Happ ; Colucci, Lucas ; Kohayakawa, Yoshiharu

    Source: Journal of Graph Theory. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e COLUCCI, Lucas e KOHAYAKAWA, Yoshiharu. The mod k chromatic index of random graphs. Journal of Graph Theory, v. 103, n. 4, p. 767-779, 2023Tradução . . Disponível em: https://doi.org/10.1002/jgt.22946. Acesso em: 11 nov. 2024.

    • APA

      Botler, F. H., Colucci, L., & Kohayakawa, Y. (2023). The mod k chromatic index of random graphs. Journal of Graph Theory, 103( 4), 767-779. doi:10.1002/jgt.22946

    • NLM

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1002/jgt.22946

    • Vancouver

      Botler FH, Colucci L, Kohayakawa Y. The mod k chromatic index of random graphs [Internet]. Journal of Graph Theory. 2023 ; 103( 4): 767-779.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1002/jgt.22946

  • Artigo de periodico

    Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)

    Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko

    Source: Journal of Combinatorial Optimization. Unidade: IME

    Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS

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

    • ABNT

      MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 11 nov. 2024.

    • APA

      Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x

    • NLM

      Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/s10878-023-01058-x

    • Vancouver

      Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1007/s10878-023-01058-x

1 - 20 (355 records)

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