scientific article; zbMATH DE number 7204590
From MaRDI portal
Publication:5111471
DOI10.4230/LIPICS.ICALP.2017.138zbMATH Open1442.68260MaRDI QIDQ5111471FDOQ5111471
Anatolii Kostrygin, Benjamin Doerr
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network protocols (68M12)
Cited In (14)
- Finding rumor sources on random trees
- Rumor spreading models with random denials
- Quasirandom Rumor Spreading: An Experimental Analysis
- Continuous-time stochastic analysis of rumor spreading with multiple operations
- Asymptotically optimal randomized rumor spreading
- Randomized Rumor Spreading Revisited (Long Version)
- Title not available (Why is that?)
- Stochastic analysis of rumor spreading with multiple pull operations
- Randomized Rumor Spreading in Dynamic Graphs
- Robustness of randomized rumour spreading
- Asymptotics for pull on the complete graph
- Title not available (Why is that?)
- Sharp Thresholds in Random Simple Temporal Graphs
- On the Push&Pull Protocol for Rumor Spreading
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111471)
