Efficient Gossiping by Packets in Networks with Random Faults
From MaRDI portal
Publication:4875431
DOI10.1137/0409002zbMath0843.68005MaRDI QIDQ4875431
Publication date: 5 June 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0409002
68M10: Network design and communication in computer systems
68W10: Parallel algorithms in computer science
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, Longest fault-free paths in star graphs with vertex faults, Longest fault-free paths in hypercubes with vertex faults, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, Fault-free longest paths in star networks with conditional link faults, Embedding Hamiltonian cycles in alternating group graphs under conditional fault model, Communication complexity of fault-tolerant information diffusion, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model