Effective algorithm for finding shortest paths in dense Gaussian networks
From MaRDI portal
Publication:5871442
DOI10.17223/20710410/58/9OpenAlexW4318826118MaRDI QIDQ5871442
O. G. Monakhov, Eh. A. Monakhova
Publication date: 19 January 2023
Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/pdm788
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
- A survey on multi-loop networks.
- Computing the Diameter in Multiple-Loop Networks
- Modeling Toroidal Networks with the Gaussian Integers
- A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS
- L-Networks: A Topological Model for Regular 2D Interconnection Networks
- Computing and Combinatorics