Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions

DOI10.1007/978-3-642-25591-5_21zbMath1350.68211OpenAlexW1687939007MaRDI QIDQ3104613

Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/36409/5/Stauffer_Algorithmica.pdf

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Randomized algorithms (68W20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Stretch and diameter in random geometric graphs

This page was built for publication: Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions