Pages that link to "Item:Q1902897"
From MaRDI portal
The following pages link to Close-to-optimal and near-optimal broadcasting in random graphs (Q1902897):
Displaying 15 items.
- Optimal and near-optimal broadcast in random graphs (Q921019) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Probabilistic flooding for efficient information dissemination in random graph topologies (Q1957826) (← links)
- The unit acquisition number of binomial random graphs (Q2048570) (← links)
- Broadcasting on paths and cycles (Q2138979) (← links)
- The total acquisition number of random geometric graphs (Q2401413) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model (Q4808317) (← links)
- Broadcasting on Random Directed Acyclic Graphs (Q5211634) (← links)
- An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network (Q5346432) (← links)
- (Q5417718) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5891998) (← links)
- Broadcasting in random graphs (Q5906597) (← links)
- Broadcasting in random graphs (Q5967062) (← links)
- Optimal Broadcast with Partial Knowledge (Q6062521) (← links)