Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
Calinescu, Gruia 
; Fernandes, Cristina Gomes ; Reed, Bruce
Fonte: Proceedings. Nome do evento: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME
Assuntos: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 28 nov. 2025.APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/3-540-69346-7_11Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2025 nov. 28 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
