The total acquisition number of random graphs
From MaRDI portal
Publication:2629497
zbMath1339.05366arXiv1402.2854MaRDI QIDQ2629497
Patrick Bennett, Andrzej Dudek, Deepak Bal, Paweł Prałat
Publication date: 6 July 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2854
Related Items
The unit acquisition number of a graph, The unit acquisition number of binomial random graphs, Weighted total acquisition, The total acquisition number of random geometric graphs, The total acquisition number of the randomly weighted path
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional acquisition in graphs
- Embedding nearly-spanning bounded degree trees
- Close-to-optimal and near-optimal broadcasting in random graphs
- Spanning trees in random graphs
- Embedding Spanning Trees in Random Graphs
- A survey of gossiping and broadcasting in communication networks
- Fast Gossiping by Short Messages
- Total Acquisition in Graphs
- On the Concentration of the Domination Number of the Random Graph
- Broadcasting in random graphs