ReP USP - Resultado da busca

Artigo de periodico
On minimum bisection and related cut problems in trees and tree-like graphs (2018)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, v. 89, n. 2, p. 214-245, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22248. Acesso em: 04 out. 2024.
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2018). On minimum bisection and related cut problems in trees and tree-like graphs. Journal of Graph Theory, 89( 2), 214-245. doi:10.1002/jgt.22248
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2024 out. 04 ] Available from: https://doi.org/10.1002/jgt.22248
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related cut problems in trees and tree-like graphs [Internet]. Journal of Graph Theory. 2018 ; 89( 2): 214-245.[citado 2024 out. 04 ] Available from: https://doi.org/10.1002/jgt.22248
Trabalho de evento-anais periodico
On minimum bisection and related partition problems in graphs with bounded tree width (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with bounded tree width. 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.2015.06.067. Acesso em: 04 out. 2024. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Trabalho de evento-anais periodico
Approximating minimum k-section in trees with linear diameter (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. Approximating minimum k-section in trees with linear diameter. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.013. Acesso em: 04 out. 2024. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). Approximating minimum k-section in trees with linear diameter. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.013
NLM
Fernandes CG, Schmidt TJ, Taraz A. Approximating minimum k-section in trees with linear diameter [Internet]. 2015 ; 50 71-76.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.endm.2015.07.013
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. Approximating minimum k-section in trees with linear diameter [Internet]. 2015 ; 50 71-76.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.endm.2015.07.013

USP Schools

ReP

Filtros

Funding Agencies