The total acquisition number of random geometric graphs
From MaRDI portal
Publication:2401413
zbMath1369.05184arXiv1611.07111MaRDI QIDQ2401413
Ewa Infeld, Paweł Prałat, Dieter Mitsche
Publication date: 8 September 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.07111
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (3)
The unit acquisition number of a graph ⋮ Weighted total acquisition ⋮ The unit acquisition number of binomial random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional acquisition in graphs
- Close-to-optimal and near-optimal broadcasting in random graphs
- The total acquisition number of the randomly weighted path
- The total acquisition number of random graphs
- A survey of gossiping and broadcasting in communication networks
- Fast Gossiping by Short Messages
- Random Geometric Graphs
- Total Acquisition in Graphs
- Broadcasting in random graphs
This page was built for publication: The total acquisition number of random geometric graphs