Yazar "Ugurlu, Onur" seçeneğine göre listele

Listeleniyor 1 - 1 / 1
  • Küçük Resim Yok
    Öğe
    A Mathematical Model For Finding The Rainbow Connection Number
    (Ieee, 2013) Nuriyeva, Fidan; Ugurlu, Onur; Kutucu, Hakan
    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.