𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Connectivity for Dynamic Random Geometric Graphs

✍ Scribed by Diaz, J.; Mitsche, D.; Perez-Gimenez, X.

Book ID
120977033
Publisher
IEEE
Year
2009
Tongue
English
Weight
970 KB
Volume
8
Category
Article
ISSN
1536-1233

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Highly connected random geometric graphs
Highly connected random geometric graphs
✍ Paul Balister; BΓ©la BollobΓ‘s; Amites Sarkar; Mark Walters πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 783 KB
On k-connectivity for a geometric random
On k-connectivity for a geometric random graph
✍ Mathew D. Penrose πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 255 KB πŸ‘ 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## Ε½ . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected Ε½ . w x respectively, has minimum degree k