A Markov chain model for the search time for max degree nodes in a graph using a biased random walk - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Jonathan Stokes' in GoogleThis author has not been identified. Look up 'Steven Weber' in Google

runs on WebDSL