Distributed fault-tolerant ring embedding and reconfiguration in hypercubes
From MaRDI portal
Publication:4571390
DOI10.1109/12.743414zbMath1392.68077OpenAlexW2134110344MaRDI QIDQ4571390
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/02261a456efba81414e49bfac97a315d7de8d327
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)
Related Items (5)
On some super fault-tolerant Hamiltonian graphs ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ A recursively construction scheme for super fault-tolerant Hamiltonian graphs ⋮ Path embedding in faulty hypercubes ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes
This page was built for publication: Distributed fault-tolerant ring embedding and reconfiguration in hypercubes
