Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2022, Number 58, Pages 94–104
DOI: https://doi.org/10.17223/20710410/58/9
(Mi pdm788)
 

Applied Graph Theory

Effective algorithm for finding shortest paths in dense Gaussian networks

E. A. Monakhova, O. G. Monakhov

Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia
References:
Abstract: As a promising topology of networks on a chip, we consider a family of Dense Gaussian Networks, which are optimal circulant degree four graphs of the form $C(D^2+(D+1)^2; D, D+1)$. For this family, an algorithm for finding the shortest paths between graph vertices is proposed, which uses relative addressing of vertices and, unlike a number of the known algorithms, allows to calculate the shortest paths without using the coordinates of neighboring lattice zeros in a dense tessellation of graphs on the $\mathbb{Z}^2$ plane. This reduces the memory and execution time costs compared to other algorithms when the new algorithm is implemented on a network-on-chip with a Dense Gaussian Network topology.
Keywords: Dense Gaussian Networks, circulant graphs, shortest paths, networks on a chip.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 0251-2021-0005
Bibliographic databases:
Document Type: Article
UDC: 519.87
Language: Russian
Citation: E. A. Monakhova, O. G. Monakhov, “Effective algorithm for finding shortest paths in dense Gaussian networks”, Prikl. Diskr. Mat., 2022, no. 58, 94–104
Citation in format AMSBIB
\Bibitem{MonMon22}
\by E.~A.~Monakhova, O.~G.~Monakhov
\paper Effective algorithm for finding shortest paths in~dense~Gaussian networks
\jour Prikl. Diskr. Mat.
\yr 2022
\issue 58
\pages 94--104
\mathnet{http://mi.mathnet.ru/pdm788}
\crossref{https://doi.org/10.17223/20710410/58/9}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4542121}
Linking options:
  • https://www.mathnet.ru/eng/pdm788
  • https://www.mathnet.ru/eng/pdm/y2022/i4/p94
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:83
    Full-text PDF :35
    References:19
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024