Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.

DOI10.1016/S0020-0190(98)00050-7zbMath1078.68593OpenAlexW2017402279MaRDI QIDQ2583551

Ilyong Chung, Seongyeol Kim

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00050-7

zbMATH Keywords

AlgorithmsHamiltonian circuitLatin squareInterconnection networksRecursive circulant graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (3)

Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)

Cites Work

• On Group Graphs and Their Fault Tolerance
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Optimum broadcasting and personalized communication in hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.