On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs

Jonathan Stokes, Steven Weber. On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs. In 2016 IEEE Global Communications Conference, GLOBECOM 2016, Washington, DC, USA, December 4-8, 2016. pages 1-7, IEEE, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.