On the expansion and diameter of bluetooth-like topologies
From MaRDI portal
Publication:1946491
DOI10.1007/s00224-012-9390-7zbMath1261.68010OpenAlexW2056176357MaRDI QIDQ1946491
Alberto Pettarin, Geppino Pucci, Andrea Pietracaprina
Publication date: 15 April 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9390-7
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Cites Work
- Area-time lower-bound techniques with applications to sorting
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Expansion properties of (secure) wireless networks
- On the Expansion and Diameter of Bluetooth-Like Topologies
- Random Geometric Graphs
- Probability and Computing
- On random points in the unit disk
This page was built for publication: On the expansion and diameter of bluetooth-like topologies