ReP USP - Resultado da busca

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
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: 25 set. 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 set. 25 ] 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 set. 25 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
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
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: 25 set. 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 set. 25 ] 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 set. 25 ] Available from: https://doi.org/10.37236/12548
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
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: 25 set. 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 set. 25 ] 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 set. 25 ] Available from: https://doi.org/10.1016/j.jcss.2023.02.006
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
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: 25 set. 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 set. 25 ] 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 set. 25 ] Available from: https://doi.org/10.1002/jgt.22866
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
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: 25 set. 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 set. 25 ] 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 set. 25 ] Available from: https://doi.org/10.1002/jgt.22946
Artigo de periodico
Pay attention to evolution: time series forecasting with deep graph-evolution learning (2022)
Spadon, Gabriel ; Hong, Shenda ; Machado, Bruno Brandoli ; Matwin, Stan ; Rodrigues Junior, José Fernando ; Sun, Jimeng
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. Unidade: ICMC
Subjects: PREVISÃO (ANÁLISE DE SÉRIES TEMPORAIS), APRENDIZADO COMPUTACIONAL, REDES NEURAIS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SPADON, Gabriel et al. Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, v. 44, n. 9, p. Se 2022, 2022Tradução . . Disponível em: https://doi.org/10.1109/TPAMI.2021.3076155. Acesso em: 25 set. 2024.
APA
Spadon, G., Hong, S., Machado, B. B., Matwin, S., Rodrigues Junior, J. F., & Sun, J. (2022). Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, 44( 9), Se 2022. doi:10.1109/TPAMI.2021.3076155
NLM
Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 set. 25 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
Vancouver
Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 set. 25 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
Artigo de periodico
Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph C*-algebras (2022)
Abrams, Gene ; Dokuchaev, Michael ; Nam, T. G.
Source: Journal of Algebra. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ABRAMS, Gene e DOKUCHAEV, Michael e NAM, T. G. Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph C*-algebras. Journal of Algebra, v. 593, p. 72-104, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.jalgebra.2021.11.004. Acesso em: 25 set. 2024.
APA
Abrams, G., Dokuchaev, M., & Nam, T. G. (2022). Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph C*-algebras. Journal of Algebra, 593, 72-104. doi:10.1016/j.jalgebra.2021.11.004
NLM
Abrams G, Dokuchaev M, Nam TG. Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph C*-algebras [Internet]. Journal of Algebra. 2022 ; 593 72-104.[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jalgebra.2021.11.004
Vancouver
Abrams G, Dokuchaev M, Nam TG. Realizing corners of Leavitt path algebras as Steinberg algebras, with corresponding connections to graph C*-algebras [Internet]. Journal of Algebra. 2022 ; 593 72-104.[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jalgebra.2021.11.004
Artigo de periodico
Finding any given 2-factor in sparse pseudorandom graphs efficiently (2021)
Han, Jie ; Kohayakawa, Yoshiharu ; Morris, Patrick; Person, Yury
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, v. 96, n. 1, p. 87-108, 2021Tradução . . Disponível em: https://doi.org/10.1002/jgt.22576. Acesso em: 25 set. 2024.
APA
Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576
NLM
Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2024 set. 25 ] Available from: https://doi.org/10.1002/jgt.22576
Vancouver
Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2024 set. 25 ] Available from: https://doi.org/10.1002/jgt.22576
Artigo de periodico
On strong Sidon sets of integers (2021)
Kohayakawa, Yoshiharu ; Lee, Sang June ; Moreira, Carlos Gustavo; Rodl, Vojtech
Source: Journal of Combinatorial Theory, Series A. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, v. 183, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2021.105490. Acesso em: 25 set. 2024.
APA
Kohayakawa, Y., Lee, S. J., Moreira, C. G., & Rodl, V. (2021). On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, 183. doi:10.1016/j.jcta.2021.105490
NLM
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Vancouver
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Artigo de periodico
Efficient Laplacian spectral density computations for networks with arbitrary degree distributions (2021)
Guzman, Grover Enrique Castro ; Stadler, Peter F. ; Fujita, André
Source: Network Science. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUZMAN, Grover Enrique Castro e STADLER, Peter F. e FUJITA, André. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, v. 9, n. 3, p. 312-327, 2021Tradução . . Disponível em: https://doi.org/10.1017/nws.2021.10. Acesso em: 25 set. 2024.
APA
Guzman, G. E. C., Stadler, P. F., & Fujita, A. (2021). Efficient Laplacian spectral density computations for networks with arbitrary degree distributions. Network Science, 9( 3), 312-327. doi:10.1017/nws.2021.10
NLM
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2024 set. 25 ] Available from: https://doi.org/10.1017/nws.2021.10
Vancouver
Guzman GEC, Stadler PF, Fujita A. Efficient Laplacian spectral density computations for networks with arbitrary degree distributions [Internet]. Network Science. 2021 ; 9( 3): 312-327.[citado 2024 set. 25 ] Available from: https://doi.org/10.1017/nws.2021.10
Artigo de periodico
Covering 3-edge-colored random graphs with monochromatic trees (2021)
Kohayakawa, Yoshiharu ; Mendonça, Walner ; Mota, Guilherme Oliveira ; Schülke, Bjarne
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, v. 35, n. 2, p. 1447-1459, 2021Tradução . . Disponível em: https://doi.org/10.1137/20M137464X. Acesso em: 25 set. 2024.
APA
Kohayakawa, Y., Mendonça, W., Mota, G. O., & Schülke, B. (2021). Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, 35( 2), 1447-1459. doi:10.1137/20M137464X
NLM
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2024 set. 25 ] Available from: https://doi.org/10.1137/20M137464X
Vancouver
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2024 set. 25 ] Available from: https://doi.org/10.1137/20M137464X
Artigo de periodico
Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming (2021)
Proença, Nathan Benedetto; Silva, Marcel Kenji de Carli ; Coutinho, Gabriel
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: PESQUISA OPERACIONAL, COMBINATÓRIA, TEORIA DOS GRAFOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto e SILVA, Marcel Kenji de Carli e COUTINHO, Gabriel. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, v. 35, n. 4, p. 2880–2907, 2021Tradução . . Disponível em: https://doi.org/10.1137/19M1306427. Acesso em: 25 set. 2024.
APA
Proença, N. B., Silva, M. K. de C., & Coutinho, G. (2021). Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, 35( 4), 2880–2907. doi:10.1137/19M1306427
NLM
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 25 ] Available from: https://doi.org/10.1137/19M1306427
Vancouver
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 25 ] Available from: https://doi.org/10.1137/19M1306427
Artigo de periodico
Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon (2021)
Fernandes, Cristina Gomes ; Pina Júnior, José Coelho de ; Ramírez Alfonsín, Jorge Luis; Robins, Sinai
Source: Discrete & Computational Geometry. Unidade: IME
Subjects: ENUMERAÇÃO E IDENTIDADE COMBINATÓRIAS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, v. 65, n. 1, p. 227-243, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00454-020-00192-1. Acesso em: 25 set. 2024.
APA
Fernandes, C. G., Pina Júnior, J. C. de, Ramírez Alfonsín, J. L., & Robins, S. (2021). Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, 65( 1), 227-243. doi:10.1007/s00454-020-00192-1
NLM
Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s00454-020-00192-1
Vancouver
Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s00454-020-00192-1
Artigo de periodico
The multicolour size-Ramsey number of powers of paths (2020)
Han, Jie ; Jenssen, Matthew ; Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Roberts, Barnaby
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, v. 145, p. 359-375, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2020.06.004. Acesso em: 25 set. 2024.
APA
Han, J., Jenssen, M., Kohayakawa, Y., Mota, G. O., & Roberts, B. (2020). The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, 145, 359-375. doi:10.1016/j.jctb.2020.06.004
NLM
Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jctb.2020.06.004
Vancouver
Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.jctb.2020.06.004
Artigo de periodico
Nontrivial path covers of graphs: existence, minimization and maximization (2020)
Gómez, Renzo ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e WAKABAYASHI, Yoshiko. Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, v. 39, n. 2, p. 437-456, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10878-019-00488-w. Acesso em: 25 set. 2024.
APA
Gómez, R., & Wakabayashi, Y. (2020). Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, 39( 2), 437-456. doi:10.1007/s10878-019-00488-w
NLM
Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s10878-019-00488-w
Vancouver
Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s10878-019-00488-w
Artigo de periodico
Amalgamation and Ramsey properties of Lp spaces (2020)
Ferenczi, Valentin ; Lopez-Abad, Jorge ; Mbombo, ‪Brice Rodrigue ; Todorcevic, Stevo
Source: Advances in Mathematics. Unidade: IME
Subjects: ESPAÇOS L^P, ESPAÇOS DE BANACH, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERENCZI, Valentin et al. Amalgamation and Ramsey properties of Lp spaces. Advances in Mathematics, v. 369, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.aim.2020.107190. Acesso em: 25 set. 2024.
APA
Ferenczi, V., Lopez-Abad, J., Mbombo, ‪B. R., & Todorcevic, S. (2020). Amalgamation and Ramsey properties of Lp spaces. Advances in Mathematics, 369. doi:10.1016/j.aim.2020.107190
NLM
Ferenczi V, Lopez-Abad J, Mbombo ‪BR, Todorcevic S. Amalgamation and Ramsey properties of Lp spaces [Internet]. Advances in Mathematics. 2020 ; 369[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.aim.2020.107190
Vancouver
Ferenczi V, Lopez-Abad J, Mbombo ‪BR, Todorcevic S. Amalgamation and Ramsey properties of Lp spaces [Internet]. Advances in Mathematics. 2020 ; 369[citado 2024 set. 25 ] Available from: https://doi.org/10.1016/j.aim.2020.107190
Artigo de periodico
Optimal low-latency network topologies for cluster performance enhancement (2020)
Deng, Yuefan ; Guo, Meng ; Ramos, Alexandre Ferreira ; Huang, Xiaolong ; Xu, Zhipeng ; Liu, Weifeng
Source: The Journal of Supercomputing. Unidade: EACH
Subjects: TEORIA DOS GRAFOS, BENCHMARKS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DENG, Yuefan et al. Optimal low-latency network topologies for cluster performance enhancement. The Journal of Supercomputing, v. 76, n. 12, p. 9558-9584, 2020Tradução . . Disponível em: https://doi.org/10.1007/s11227-020-03216-y. Acesso em: 25 set. 2024.
APA
Deng, Y., Guo, M., Ramos, A. F., Huang, X., Xu, Z., & Liu, W. (2020). Optimal low-latency network topologies for cluster performance enhancement. The Journal of Supercomputing, 76( 12), 9558-9584. doi:10.1007/s11227-020-03216-y
NLM
Deng Y, Guo M, Ramos AF, Huang X, Xu Z, Liu W. Optimal low-latency network topologies for cluster performance enhancement [Internet]. The Journal of Supercomputing. 2020 ; 76( 12): 9558-9584.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s11227-020-03216-y
Vancouver
Deng Y, Guo M, Ramos AF, Huang X, Xu Z, Liu W. Optimal low-latency network topologies for cluster performance enhancement [Internet]. The Journal of Supercomputing. 2020 ; 76( 12): 9558-9584.[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s11227-020-03216-y
Artigo de periodico
Commute time as a method to explore brain functional connectomes (2019)
Sato, João Ricardo; Sato, Cristiane Maria; Silva, Marcel Kenji de Carli ; Biazoli, Claudinei Eduardo
Source: Brain Connectivity. Unidade: IME
Subjects: TRANSTORNO DO DEFICIT DE ATENÇÃO COM HIPERATIVIDADE, IMAGEM POR RESSONÂNCIA MAGNÉTICA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SATO, João Ricardo et al. Commute time as a method to explore brain functional connectomes. Brain Connectivity, v. 9, n. 2, p. 155-161, 2019Tradução . . Disponível em: https://doi.org/10.1089/brain.2018.0598. Acesso em: 25 set. 2024.
APA
Sato, J. R., Sato, C. M., Silva, M. K. de C., & Biazoli, C. E. (2019). Commute time as a method to explore brain functional connectomes. Brain Connectivity, 9( 2), 155-161. doi:10.1089/brain.2018.0598
NLM
Sato JR, Sato CM, Silva MK de C, Biazoli CE. Commute time as a method to explore brain functional connectomes [Internet]. Brain Connectivity. 2019 ; 9( 2): 155-161.[citado 2024 set. 25 ] Available from: https://doi.org/10.1089/brain.2018.0598
Vancouver
Sato JR, Sato CM, Silva MK de C, Biazoli CE. Commute time as a method to explore brain functional connectomes [Internet]. Brain Connectivity. 2019 ; 9( 2): 155-161.[citado 2024 set. 25 ] Available from: https://doi.org/10.1089/brain.2018.0598
Artigo de periodico
Counting Hamiltonian cycles in the matroid basis graph (2019)
Fernandes, Cristina Gomes ; Hernández Vélez, César ; Pina Júnior, José Coelho de ; Ramírez Alfonsín, Jorge Luis
Source: Graphs and Combinatorics. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Counting Hamiltonian cycles in the matroid basis graph. Graphs and Combinatorics, v. 35, n. 2, 2019Tradução . . Disponível em: https://doi.org/10.1007/s00373-019-02011-8. Acesso em: 25 set. 2024.
APA
Fernandes, C. G., Hernández Vélez, C., Pina Júnior, J. C. de, & Ramírez Alfonsín, J. L. (2019). Counting Hamiltonian cycles in the matroid basis graph. Graphs and Combinatorics, 35( 2). doi:10.1007/s00373-019-02011-8
NLM
Fernandes CG, Hernández Vélez C, Pina Júnior JC de, Ramírez Alfonsín JL. Counting Hamiltonian cycles in the matroid basis graph [Internet]. Graphs and Combinatorics. 2019 ; 35( 2):[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s00373-019-02011-8
Vancouver
Fernandes CG, Hernández Vélez C, Pina Júnior JC de, Ramírez Alfonsín JL. Counting Hamiltonian cycles in the matroid basis graph [Internet]. Graphs and Combinatorics. 2019 ; 35( 2):[citado 2024 set. 25 ] Available from: https://doi.org/10.1007/s00373-019-02011-8
Artigo de periodico
The size-Ramsey number of powers of paths (2019)
Clemens, Dennis; Jenssen, Matthew; Kohayakawa, Yoshiharu ; Morrison, Natasha; Mota, Guilherme Oliveira; Reding, Damian; Roberts, Barnaby
Source: Journal of Graph Theory. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CLEMENS, Dennis et al. The size-Ramsey number of powers of paths. Journal of Graph Theory, v. 91, n. 3, p. 290-299, 2019Tradução . . Disponível em: https://doi.org/10.1002/jgt.22432. Acesso em: 25 set. 2024.
APA
Clemens, D., Jenssen, M., Kohayakawa, Y., Morrison, N., Mota, G. O., Reding, D., & Roberts, B. (2019). The size-Ramsey number of powers of paths. Journal of Graph Theory, 91( 3), 290-299. doi:10.1002/jgt.22432
NLM
Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.[citado 2024 set. 25 ] Available from: https://doi.org/10.1002/jgt.22432
Vancouver
Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.[citado 2024 set. 25 ] Available from: https://doi.org/10.1002/jgt.22432

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration