A mathematical model for finding the rainbow connection number

Basit Öğe Kaydı
dc.contributor.authorNuriyeva, F.
dc.contributor.authorUgurlu, O.
dc.contributor.authorKutucu, H.
dc.date.accessioned2024-09-29T16:20:55Z
dc.date.available2024-09-29T16:20:55Z
dc.date.issued2013
dc.departmentKarabük Üniversitesien_US
dc.descriptionAzercell Telecom; MIKRO Bilgi; State Oil Company of Azerbaijan Republic (SOCAR); Turkish Cooperation and Coordination Agency (TIKA); TUSIABen_US
dc.description7th International Conference on Application of Information and Communication Technologies, AICT 2013 -- 23 October 2013 through 25 October 2013 -- Baku -- 102729en_US
dc.description.abstractThe 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.en_US
dc.identifier.doi10.1109/ICAICT.2013.6722630
dc.identifier.isbn978-146736420-1
dc.identifier.scopus2-s2.0-84894136347en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1109/ICAICT.2013.6722630
dc.identifier.urihttps://hdl.handle.net/20.500.14619/9416
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.relation.ispartofAICT 2013 - 7th International Conference on Application of Information and Communication Technologies, Conference Proceedingsen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectmathematical modellingen_US
dc.subjectoptimizationen_US
dc.subjectRainbow connectionen_US
dc.titleA mathematical model for finding the rainbow connection numberen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu