Node-to-node cluster fault tolerant routing in star graphs
From MaRDI portal
Publication:1350230
DOI10.1016/0020-0190(95)00135-YzbMath0998.68507MaRDI QIDQ1350230
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Node-to-set disjoint paths problem in star graphs ⋮ An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs ⋮ Cluster connectivity of hypercube-based networks under the super fault-tolerance condition ⋮ AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ Fault-tolerant routing in burnt pancake graphs
Cites Work