AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH
DOI10.1142/S0129054114500300zbMath1304.68018OpenAlexW2115219309MaRDI QIDQ2941089
Chiao-Wei Chiu, Chang-Biau Yang, Chiou-Ting Tseng, Kuo-Si Huang
Publication date: 21 January 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114500300
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Cites Work
- Weak-vertex-pancyclicity of (\(n,k\))-star graphs
- Node-to-node cluster fault tolerant routing in star graphs
- The \((n,k)\)-star graph: A generalized star graph
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
- Fault Tolerance on Star Graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
This page was built for publication: AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH