Near-optimum universal graphs for graphs with bounded degrees (2001)
Alon, Noga; Capalbo, Michael; Wakabayashi, Yoshiko 
; Rodl, Vojtech; Rucinski, Andrzej; Szemerédi, Endre
Fonte: Proceedings. Nome do evento: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Near-optimum universal graphs for graphs with bounded degrees. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44666-4_20. Acesso em: 09 jul. 2024.APA
Alon, N., Capalbo, M., Wakabayashi, Y., Rodl, V., Rucinski, A., & Szemerédi, E. (2001). Near-optimum universal graphs for graphs with bounded degrees. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44666-4_20NLM
Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/3-540-44666-4_20Vancouver
Alon N, Capalbo M, Wakabayashi Y, Rodl V, Rucinski A, Szemerédi E. Near-optimum universal graphs for graphs with bounded degrees [Internet]. Proceedings. 2001 ;[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/3-540-44666-4_20
