A Mathematical Model For Finding The Rainbow Connection Number
Küçük Resim Yok
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ieee
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.
Açıklama
7th International Conference on Application of Information and Communication Technologies (AICT) -- OCT 23-25, 2013 -- Baku, AZERBAIJAN
Anahtar Kelimeler
Rainbow connection, mathematical modelling, optimization
Kaynak
2013 7th International Conference On Application of Information and Communication Technologies (Aict)
WoS Q Değeri
N/A