Hamiltonian path, routing, broadcasting algorithms for connected square network graphs
Connected 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 devel...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-08-01
|
| Series: | Engineering Science and Technology, an International Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2215098623001325 |
| _version_ | 1797774526885396480 |
|---|---|
| author | Burhan Selçuk Ayşe Nur Altintaş Tankül |
| author_facet | Burhan Selçuk Ayşe Nur Altintaş Tankül |
| author_sort | Burhan Selçuk |
| collection | DOAJ |
| description | Connected 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. |
| first_indexed | 2024-03-12T22:22:23Z |
| format | Article |
| id | doaj.art-0fb3c363c7eb4da18f5699aa756fa868 |
| institution | Directory Open Access Journal |
| issn | 2215-0986 |
| language | English |
| last_indexed | 2024-03-12T22:22:23Z |
| publishDate | 2023-08-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Engineering Science and Technology, an International Journal |
| spelling | doaj.art-0fb3c363c7eb4da18f5699aa756fa8682023-07-23T04:54:29ZengElsevierEngineering Science and Technology, an International Journal2215-09862023-08-0144101454Hamiltonian path, routing, broadcasting algorithms for connected square network graphsBurhan Selçuk0Ayşe Nur Altintaş Tankül1Corresponding author.; Department of Computer Engineering, Karabuk University, 78050 Karabuk, TurkeyDepartment of Computer Engineering, Karabuk University, 78050 Karabuk, TurkeyConnected 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.http://www.sciencedirect.com/science/article/pii/S2215098623001325MeshesHamiltonian pathRoutingBroadcasting |
| spellingShingle | Burhan Selçuk Ayşe Nur Altintaş Tankül Hamiltonian path, routing, broadcasting algorithms for connected square network graphs Engineering Science and Technology, an International Journal Meshes Hamiltonian path Routing Broadcasting |
| title | Hamiltonian path, routing, broadcasting algorithms for connected square network graphs |
| title_full | Hamiltonian path, routing, broadcasting algorithms for connected square network graphs |
| title_fullStr | Hamiltonian path, routing, broadcasting algorithms for connected square network graphs |
| title_full_unstemmed | Hamiltonian path, routing, broadcasting algorithms for connected square network graphs |
| title_short | Hamiltonian path, routing, broadcasting algorithms for connected square network graphs |
| title_sort | hamiltonian path routing broadcasting algorithms for connected square network graphs |
| topic | Meshes Hamiltonian path Routing Broadcasting |
| url | http://www.sciencedirect.com/science/article/pii/S2215098623001325 |
| work_keys_str_mv | AT burhanselcuk hamiltonianpathroutingbroadcastingalgorithmsforconnectedsquarenetworkgraphs AT aysenuraltintastankul hamiltonianpathroutingbroadcastingalgorithmsforconnectedsquarenetworkgraphs |