1 Ocak 2016 Dergi makalesi Açık Erişim

Kutucu, H.; Nuriyeva, F.; Ugurlu, O.

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:55933</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.81043/aperta.55932</subfield>
    <subfield code="n">doi</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Kutucu, H.</subfield>
    <subfield code="u">Karabuk Univ, Dept Comp Engn, Karabuk, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:63fb2a09ffa8af6db2c3a613872b6187</subfield>
    <subfield code="s">142</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/55933/files/bib-3bcabc52-695d-4182-ab04-6f4b184aa56d.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315235733.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2016-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.81043/aperta.55933</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">THE RAINBOW CONNECTION PROBLEM: MATHEMATICAL FORMULATIONS</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">127</subfield>
    <subfield code="c">101-108</subfield>
    <subfield code="p">ARS COMBINATORIA</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Nuriyeva, F.</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Ugurlu, O.</subfield>
    <subfield code="u">Ege Univ, Dept Math, Izmir, Turkey</subfield>
  </datafield>
  <controlfield tag="001">55933</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>