Entropy and heterogeneity measures for directed graphs (2013)
Cheng, Ye; Wilson, Richard C.; Comin, César H.; Costa, Luciano da Fontoura 
; Hancock, Edwin R.
Fonte: Lecture Notes in Computer Science. Nome do evento: International Workshop on Similarity-Based Patter Analysis and Recognition - SIMBAD. Unidade: IFSC
Assuntos: PROCESSAMENTO DE IMAGENS, ENTROPIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHENG, Ye et al. Entropy and heterogeneity measures for directed graphs. Lecture Notes in Computer Science. Heidelberg: Springer. Disponível em: https://doi.org/10.1007/978-3-642-39140-8_15. Acesso em: 18 nov. 2024. , 2013APA
Cheng, Y., Wilson, R. C., Comin, C. H., Costa, L. da F., & Hancock, E. R. (2013). Entropy and heterogeneity measures for directed graphs. Lecture Notes in Computer Science. Heidelberg: Springer. doi:10.1007/978-3-642-39140-8_15NLM
Cheng Y, Wilson RC, Comin CH, Costa L da F, Hancock ER. Entropy and heterogeneity measures for directed graphs [Internet]. Lecture Notes in Computer Science. 2013 ; 7953 219-234.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/978-3-642-39140-8_15Vancouver
Cheng Y, Wilson RC, Comin CH, Costa L da F, Hancock ER. Entropy and heterogeneity measures for directed graphs [Internet]. Lecture Notes in Computer Science. 2013 ; 7953 219-234.[citado 2024 nov. 18 ] Available from: https://doi.org/10.1007/978-3-642-39140-8_15
