A note on the acquaintance time of random graphs
From MaRDI portal
Publication:396895
zbMath1295.05210arXiv1305.1675MaRDI QIDQ396895
Paweł Prałat, Dieter Mitsche, William B. Kinnersley
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1675
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
A tight upper bound on acquaintance time of graphs ⋮ Collision-free network exploration ⋮ Acquaintance Time of Random Graphs Near Connectivity Threshold ⋮ The acquaintance time of (percolated) random geometric graphs
Cites Work
- A tight upper bound on acquaintance time of graphs
- New bounds for contagious sets
- The acquaintance time of (percolated) random geometric graphs
- Acquaintance Time of a Graph
- On the Approximability of Influence in Social Networks
- A survey of gossiping and broadcasting in communication networks
- Routing Permutations on Graphs via Matchings
- Unnamed Item
- Unnamed Item
- Unnamed Item