Yazar "Nuriyeva, F." seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    A mathematical model for finding the rainbow connection number
    (IEEE Computer Society, 2013) Nuriyeva, F.; Ugurlu, O.; Kutucu, H.
    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.
  • Küçük Resim Yok
    Öğe
    THE RAINBOW CONNECTION PROBLEM: MATHEMATICAL FORMULATIONS
    (Charles Babbage Res Ctr, 2016) Kutucu, H.; Nuriyeva, F.; Ugurlu, O.
    The concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is connected by at least one path in which no two edges are assigned the same color. The rainbow vertex-connection number, rvc(G), is the vertex version of this problem. In this paper, we introduce mixed integer programming models for both versions of the problem. We show the validity of the proposed models and test their efficiency using a nonlinear programming solver.
  • Küçük Resim Yok
    Öğe
    The rainbow connection problem: Mathematical formulations
    (Charles Babbage Research Centre, 2016) Kutucu, H.; Nuriyeva, F.; Ugurlu, O.
    The concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is connected by at least one path in which no two edges are assigned the same color. The rainbow vertex-connection number, rvc(G), is the vertex version of this problem. In this paper, we introduce mixed integer programming models for both versions of the problem. We show the validity of the proposed models and test their efficiency using a nonlinear programming solver.