On the Expected Maximum Degree of Gabriel and Yao Graphs
classification
💻 cs.CG
cs.DC
keywords
gabrielgraphsdegreegraphrandomad-hocapplicationsdefined
read the original abstract
Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on $n$ points drawn uniformly at random from a unit square grows as $\Theta (\log n / \log \log n)$ in probability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.