Diameter and broadcast time of random geometric graphs in arbitrary dimensions
type: Item
instance of: scholarly article
title: Diameter and broadcast time of random geometric graphs in arbitrary dimensions
zbMATH Open document ID: 1275.05050
author: Tobias Friedrich
author: Thomas Sauerwald
author: Alexandre Stauffer
published in: Algorithmica
publication date: 2013-11-11T00:00:00Z
full work available at URL: Stauffer Algorithmica.pdf
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 6225277
zbMATH Keywords: random geometric graphs
zbMATH Keywords: diameter
zbMATH Keywords: randomized rumor spreading: Euclidean distance
zbMATH Keywords: graph distance
zbMATH Keywords: randomized broadcast algorithm
zbMATH Keywords: largest connected component
MaRDI profile type: Publication
OpenAlex ID: W2019565283
cites work: On the chemical distance for supercritical Bernoulli percolation
cites work: On the cover time and mixing time of random geometric graphs
cites work: Q5417718
cites work: The cover time of the giant component of a random graph
cites work: Q4633810
cites work: Surface order large deviations for high-density percolation
cites work: Random geometric graph diameter in the unit ball
cites work: Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
cites work: On the runtime and robustness of randomized broadcasting
cites work: Randomized broadcast in networks
cites work: First passage percolation for random colorings of \(\mathbb{Z}^ d\)
cites work: Rumor Spreading on Random Regular Graphs and Expanders
cites work: The shortest-path problem for graphs with random arc-lengths
cites work: Percolation
cites work: Domination by product measures
cites work: Continuum Percolation
cites work: Thresholding random geometric graph properties motivated by ad hoc sensor networks
cites work: Large deviations for discrete and continuous percolation
cites work: The longest edge of the random minimal spanning tree
cites work: Q4265786
cites work: Random Geometric Graphs
cites work: On Spreading a Rumor
cites work: On mixing and edge expansion properties in randomized broadcasting
DOI: 10.1007/S00453-012-9710-Y
description: scientific article; zbMATH DE number 6225277