A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square

DOI10.1016/J.INS.2005.12.014zbMath1103.68016OpenAlexW2090230425MaRDI QIDQ2509233

Ilyong Chung, Young Joo Cho

Publication date: 19 October 2006

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2005.12.014

zbMATH Keywords

circulant networksHamiltonian circuit Latin squareparallel routing algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Parallel algorithms in computer science (68W10)

Related Items (5)

A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network ⋮ Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\) ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square

Cites Work

• Efficient dispersal of information for security, load balancing, and fault tolerance
• Optimum broadcasting and personalized communication in hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square