On fractal cubic network graphs

Basit Öğe Kaydı
dc.authoridhttps://orcid.org/0000-0002-4188-010X
dc.authoridhttps://orcid.org/0000-0002-5141-5148
dc.authoridhttps://orcid.org/0000-0002-1086-9514
dc.contributor.authorAltintas Tankul, Ayse Nur
dc.contributor.authorSelcuk, Burhan
dc.contributor.authorTuran, Muhammed Kamil
dc.date.accessioned2025-01-13T12:46:55Z
dc.date.available2025-01-13T12:46:55Z
dc.date.issued2025-03
dc.departmentFakülteler, Mühendislik Fakültesi, Yazılım Mühendisliği Bölümü
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.departmentFakülteler, Tıp Fakültesi, Acil Tıp Bilimleri Bölümü
dc.description.abstractThe fractal cubic network graphs (FCNG), previously studied by Karci and Selcuk (2015), are reviewed in this paper. First, general information about FCNG is provided, and new topological properties of FCNG are presented. Simulations of the topological properties of FCNG, hypercube, and 2D square meshes have been performed, and the results are introduced. Secondly, a strategy for the routing problem for FCNG is presented. A new strategy for the routing path of FCNG is presented and explained with an example, and a recursive algorithm using this strategy is presented. Thirdly, a strategy for the shortest path problem for FCNG with a similar routing strategy is also presented, and a recursive algorithm for this strategy is given. An algorithm for mapping network nodes on a 2D plane and an algorithm for computing the minimum distance connection point between fractals used to construct the shortest path are also provided. These algorithms are illustrated with an example. The running times of the algorithms are also calculated.
dc.identifier10.1016/j.jpdc.2024.105023
dc.identifier.citationTankul, A.N., Selçuk, B., & Turan, M.K. (2024). On fractal cubic network graphs. Journal of Parallel and Distributed Computing.
dc.identifier.doi10.1016/j.jpdc.2024.105023
dc.identifier.issn07437315
dc.identifier.scopus2-s2.0-85212142635
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1016/j.jpdc.2024.105023
dc.identifier.urihttps://hdl.handle.net/20.500.14619/14980
dc.identifier.volume197
dc.identifier.wosWOS:001391646600001
dc.identifier.wosqualityQ1
dc.indekslendigikaynakScopus
dc.indekslendigikaynakWeb of Science
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofJournal of Parallel and Distributed Computing
dc.relation.ispartofseriesJournal of Parallel and Distributed Computing
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subject2D mesh
dc.subjectFractals
dc.subjectInterconnection networks
dc.subjectRouting
dc.subjectShortest path
dc.titleOn fractal cubic network graphs
dc.typeArticle
oaire.citation.volume197

Dosyalar

Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
license.txt
Boyut:
1.17 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
Ä°ndir

Koleksiyon

Mühendislik Fakültesi Koleksiyonu