A Computationally Efficient Connectivity Measure for Random Graphs

Hamid Mahboubi, Mohammad Mehdi Asadi, Amir G. Aghdam, Stephane Blouin. A Computationally Efficient Connectivity Measure for Random Graphs. In 2015 IEEE Global Communications Conference, GLOBECOM 2015, San Diego, CA, USA, December 6-10, 2015. pages 1-6, IEEE, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.