Jonathan Stokes, Steven Weber. A Markov chain model for the search time for max degree nodes in a graph using a biased random walk. In 2016 Annual Conference on Information Science and Systems, CISS 2016, Princeton, NJ, USA, March 16-18, 2016. pages 448-453, IEEE, 2016. [doi]
@inproceedings{StokesW16, title = {A Markov chain model for the search time for max degree nodes in a graph using a biased random walk}, author = {Jonathan Stokes and Steven Weber}, year = {2016}, doi = {10.1109/CISS.2016.7460544}, url = {http://dx.doi.org/10.1109/CISS.2016.7460544}, researchr = {https://researchr.org/publication/StokesW16}, cites = {0}, citedby = {0}, pages = {448-453}, booktitle = {2016 Annual Conference on Information Science and Systems, CISS 2016, Princeton, NJ, USA, March 16-18, 2016}, publisher = {IEEE}, isbn = {978-1-4673-9457-4}, }