A SOLUTION TO THE THREE DISJOINT PATH PROBLEM ON HONEYCOMB MESHES
Xiaofan Yang, Graham M. Megson, SHAOMlN ZHANG, Xiaoping Liu · Parallel Processing Letters · 2004
Recently honeycomb meshes have been considered as alternative candidates for interconnection networks in parallel and distributed computer systems. This paper presents a solution to one of the open problems about honeycomb meshes—the so-called three disjoint path problem. The problem requires minimizing the length of the longest of any three disjoint paths between 3-degree nodes. This solution provides information on the re-routing of traffic along the network in the presence of faults.