Efficient Gossiping by Packets in Networks with Random Faults

DOI10.1137/0409002zbMath0843.68005OpenAlexW2055723591MaRDI QIDQ4875431

Krzysztof Diks, Andrzej Pelc

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

zbMATH Keywords

communication network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (11)

Longest fault-free paths in hypercubes with vertex faults ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Cycles in butterfly graphs ⋮ Simplified Chernoff bounds with powers-of-two probabilities ⋮ Fault-free Hamiltonian cycles in twisted cubes with conditional link faults ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Communication complexity of gossiping by packets ⋮ Longest fault-free paths in star graphs with vertex 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

This page was built for publication: Efficient Gossiping by Packets in Networks with Random Faults