Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

DOI10.1007/978-3-540-89985-3_37zbMath1188.68351OpenAlexW193685657MaRDI QIDQ3628471

Marzieh Bakhshi, Saeedeh Bakhshi, Hamid Sarbazi-Azad

Publication date: 20 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89985-3_37

zbMATH Keywords

connectivityCartesian productcomposition productparallel routingfault tolerant routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized diameters and Rabin numbers of networks
• The wide-diameter of then-dimensional toroidal mesh

This page was built for publication: Efficient Parallel Routing Algorithms for Cartesian and Composition Networks