Pages that link to "Item:Q4875431"
From MaRDI portal
The following pages link to Efficient Gossiping by Packets in Networks with Random Faults (Q4875431):
Displayed 9 items.
- Longest fault-free paths in hypercubes with vertex faults (Q819312) (← links)
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults (Q955008) (← links)
- Fault-free longest paths in star networks with conditional link faults (Q1006049) (← links)
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model (Q1007887) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults (Q2268760) (← links)
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model (Q2378525) (← links)
- (Q4953326) (← links)
- Longest fault-free paths in star graphs with vertex faults (Q5958120) (← links)