Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip

Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip

For a family of optimal two-dimensional circulant networks with an analytical description, two new improved versions of the shortest path search algorithm with a constant complexity estimate are obtained. A simple, based on the geometric model of circulant graphs, proof of the formulas used for the...

Full description

Bibliographic Details
Main Authors: Emilia A. Monakhova, Aleksandr Yu Romanov, Evgenii V. Lezhnev
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Two-dimensional circulant graphs
diameter
shortest path
optimal generalized Petersen graphs
networks-on-chip
Online Access:https://ieeexplore.ieee.org/document/9268938/

Internet

https://ieeexplore.ieee.org/document/9268938/

Similar Items