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

DOI10.1007/3-540-59175-3_114MaRDI QIDQ5096356zbMATH OpenOpenAlexFDO

Authors Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano

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) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• New results on routing via matchings on graphs
• New results in graph routing
• On compact and efficient routing in certain graph classes
• A new routing algorithm for a class of rearrangeable networks
• Algorithms and Computation
• Routing Permutations on Graphs via Matchings
• Publication:3210199
• On a routing and scheduling problem concerning multiple edge traversals in graphs
• Routing permutations on a graph

Cites work

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

Cited in

(2)

• A broadcasting algorithm on the arrangement graph
• New results in graph routing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096356)