A new approach for routing in arrangement graphs and its performance evaluation

DOI10.1007/3-540-59175-3_114zbMath1495.68184OpenAlexW1551740125MaRDI QIDQ5096356

Hideo Nakano, Hiroyuki Ebara, Peter M. Yamakawa

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_114

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Arrangement graphs: A class of generalized star graphs
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Adaptive fault-tolerant routing in hypercube multicomputers

This page was built for publication: A new approach for routing in arrangement graphs and its performance evaluation