Optimal routing in double loop networks

DOI10.1016/j.tcs.2007.04.002zbMath1188.68213OpenAlexW2010388720MaRDI QIDQ995561

Álvar Ibeas, Jaime Gutierrez, Domingo Gomez

Publication date: 3 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.002

zbMATH Keywords

shortest pathCayley graphslatticesclosest vector problemdouble loop networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Greedy routing in circulant networks ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ On Motzkin's problem in the circle group ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings ⋮ Analysis of the structured perturbation for the BCSCB linear system ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal message routing algorithm for double-loop networks
• Finding shortest paths in distributed loop networks
• Factoring polynomials with rational coefficients
• Distributed loop network with minimum transmission delay
• Geometric algorithms and combinatorial optimization.
• Optimal distributed algorithms in unlabeled tori and chordal rings
• Solving linear programs with finite precision. I: Condition numbers and random programs
• A survey on multi-loop networks.
• Fast multiplication of large numbers
• Integer Programming with a Fixed Number of Variables
• Circulants and their connectivities
• Attacking the Pollard Generator
• Minkowski's Convex Body Theorem and Integer Programming
• Diameters of weighted double loop networks
• The Generalized Gauss Reduction Algorithm
• The Generalized Basis Reduction Algorithm
• Computing the Diameter in Multiple-Loop Networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Fault-tolerant routing in distributed loop networks
• An optimal fault-tolerant routing algorithm for double-loop networks
• Predicting nonlinear pseudorandom number generators
• Optimal distance networks of low degree for parallel computers
• Computer Algebra in Scientific Computing
• Computing and Combinatorics
• Algorithms - ESA 2003
• A complementary survey on double-loop networks