Hamiltonian path, routing, broadcasting algorithms for connected square network graphs

Basit Öğe Kaydı
dc.authoridALTINTAS TANKUL, AYSE NUR/0000-0002-4188-010X
dc.authoridSelcuk, Burhan/0000-0002-5141-5148
dc.contributor.authorSelcuk, Burhan
dc.contributor.authorTankuel, Ayse Nur Altintas
dc.date.accessioned2024-09-29T15:57:36Z
dc.date.available2024-09-29T15:57:36Z
dc.date.issued2023
dc.departmentKarabük Üniversitesien_US
dc.description.abstractConnected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant. For this reason, this study focuses on development algorithms that find solutions to various problems for (CSNG) with the help of hypercube. Firstly, an efficient algorithm that finds the Hamiltonian path is given. Further, two different algorithms that perform the mapping of labels in graph and the unicast routing are given. Furthermore, the parallel process for mapping and unicast routing is discussed. Finally, guidelines are given for broadcasting algorithms. & COPY; 2023 Karabuk University. Publishing services by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).en_US
dc.identifier.doi10.1016/j.jestch.2023.101454
dc.identifier.issn2215-0986
dc.identifier.scopus2-s2.0-85164016978en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1016/j.jestch.2023.101454
dc.identifier.urihttps://hdl.handle.net/20.500.14619/4918
dc.identifier.volume44en_US
dc.identifier.wosWOS:001040384300001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevier - Division Reed Elsevier India Pvt Ltden_US
dc.relation.ispartofEngineering Science and Technology-An International Journal-Jestechen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMeshesen_US
dc.subjectHamiltonian pathen_US
dc.subjectRoutingen_US
dc.subjectBroadcastingen_US
dc.titleHamiltonian path, routing, broadcasting algorithms for connected square network graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu