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: 15 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. 15 ] 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. 15 ] Available from: https://doi.org/10.1002/jgt.22248
Artigo de periodico
A better approximation algorithm for finding planar subgraphs (1998)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Finkler, Ulrich; Karloff, Howard
Source: Journal of Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS GRÁFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia et al. A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, v. 27, n. 2, p. 269-302, 1998Tradução . . Disponível em: https://doi.org/10.1006/jagm.1997.0920. Acesso em: 15 out. 2024.
APA
Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1998). A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, 27( 2), 269-302. doi:10.1006/jagm.1997.0920
NLM
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 out. 15 ] Available from: https://doi.org/10.1006/jagm.1997.0920
Vancouver
Calinescu G, Fernandes CG, Finkler U, Karloff H. A better approximation algorithm for finding planar subgraphs [Internet]. Journal of Algorithms. 1998 ; 27( 2): 269-302.[citado 2024 out. 15 ] Available from: https://doi.org/10.1006/jagm.1997.0920
Trabalho de evento
A better approximation algorithm for finding planar subgraphs (1996)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Karloff, Howard
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KARLOFF, Howard. A better approximation algorithm for finding planar subgraphs. 1996, Anais.. New York: ACM, 1996. . Acesso em: 15 out. 2024.
APA
Calinescu, G., Fernandes, C. G., & Karloff, H. (1996). A better approximation algorithm for finding planar subgraphs. In Proceedings. New York: ACM.
NLM
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2024 out. 15 ]
Vancouver
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2024 out. 15 ]

USP Schools

ReP

Filtros

Authors

Funding Agencies