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: 09 nov. 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 nov. 09 ]Vancouver
Calinescu G, Fernandes CG, Karloff H. A better approximation algorithm for finding planar subgraphs. Proceedings. 1996 ;[citado 2024 nov. 09 ]
