The absence of isolated node in geometric random graphs
J Zhao - 2015 53rd Annual Allerton Conference on …, 2015 - ieeexplore.ieee.org
One-dimensional geometric random graphs are constructed by distributing n nodes
uniformly and independently on a unit interval and then assigning an undirected edge …
uniformly and independently on a unit interval and then assigning an undirected edge …
On characterizing the local pooling factor of greedy maximal scheduling in random graphs
The study of the optimality of low-complexity greedy scheduling techniques in wireless
communications networks is a very complex problem. The Local Pooling (LoP) factor …
communications networks is a very complex problem. The Local Pooling (LoP) factor …