A mathematical model for finding the rainbow connection number

Küçük Resim Yok

Tarih

2013

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

IEEE Computer Society

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. © 2013 IEEE.

Açıklama

Azercell Telecom; MIKRO Bilgi; State Oil Company of Azerbaijan Republic (SOCAR); Turkish Cooperation and Coordination Agency (TIKA); TUSIAB
7th International Conference on Application of Information and Communication Technologies, AICT 2013 -- 23 October 2013 through 25 October 2013 -- Baku -- 102729

Anahtar Kelimeler

mathematical modelling, optimization, Rainbow connection

Kaynak

AICT 2013 - 7th International Conference on Application of Information and Communication Technologies, Conference Proceedings

WoS Q Değeri

Scopus Q Değeri

N/A

Cilt

Sayı

Künye