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]
@inproceedings{MahboubiAAB15, title = {A Computationally Efficient Connectivity Measure for Random Graphs}, author = {Hamid Mahboubi and Mohammad Mehdi Asadi and Amir G. Aghdam and Stephane Blouin}, year = {2015}, doi = {10.1109/GLOCOM.2014.7417781}, url = {http://dx.doi.org/10.1109/GLOCOM.2014.7417781}, researchr = {https://researchr.org/publication/MahboubiAAB15}, cites = {0}, citedby = {0}, pages = {1-6}, booktitle = {2015 IEEE Global Communications Conference, GLOBECOM 2015, San Diego, CA, USA, December 6-10, 2015}, publisher = {IEEE}, isbn = {978-1-4799-5952-5}, }