Azevedo, G., & 		Wakabayashi, Y.
(2024).
 An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph.
In <em>Anais do IX Encontro de Teoria da Computação</em>, (pp. 63-67). Porto Alegre: SBC.
doi:10.5753/etc.2024.2500