A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS

DOI10.17223/20710410/47/7zbMath1455.68146OpenAlexW3012456418MaRDI QIDQ5151437

Eh. A. Monakhova

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm696

zbMATH Keywords

diametershortest pathsnetworks-on-chipoptimal generalized Petersen graphstwo-dimensional circulant networks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Effective algorithm for finding shortest paths in dense Gaussian networks

Cites Work

• Optimal routing in double loop networks
• On non-full-rank perfect codes over finite fields
• NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Modeling Toroidal Networks with the Gaussian Integers
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
• Optimal distance networks of low degree for parallel computers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS