Randomized Rumor Spreading in Dynamic Graphs
From MaRDI portal
(Redirected from Publication:5167863)
Recommendations
- Rumor spreading in random evolving graphs
- Rumor spreading in random evolving graphs
- Randomized rumor spreading revisited
- Rumor spreading on random regular graphs and expanders
- Rumor spreading on random regular graphs and expanders
- Asymptotically optimal randomized rumor spreading
- Asymptotically optimal randomized rumor spreading
- Tight analysis of randomized rumor spreading in complete graphs
Cited in
(23)- Information spreading in dynamic networks under oblivious adversaries
- On linear-time data dissemination in dynamic rooted trees
- Temporal vertex cover with a sliding time window
- Sliding window temporal graph coloring
- Linking the mixing times of random walks on static and dynamic random graphs
- The contact process with dynamic edges on \(\mathbb{Z}\)
- Deleting edges to restrict the size of an epidemic in temporal networks
- Discovery through gossip
- Finding rumor sources on random trees
- Asymptotically optimal randomized rumor spreading
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Adaptive rumor spreading
- Temporal vertex cover with a sliding time window
- Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
- Deleting edges to restrict the size of an epidemic in temporal networks
- Random Walks on Randomly Evolving Graphs
- On the Push&Pull Protocol for Rumor Spreading
- scientific article; zbMATH DE number 6783408 (Why is no real title available?)
- Tight bounds for rumor spreading with vertex expansion
- Rumor spreading and vertex expansion
- The temporal explorer who returns to the base
- Computing maximum matchings in temporal graphs
- Rumors with changing credibility
This page was built for publication: Randomized Rumor Spreading in Dynamic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167863)
