Skip to main content

Meeting times of random walks on graphs

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Analysis of algorithms; Distributed computing; Hitting time; Meeting time; Random walks

Document Type: Short Communication

DOI: http://dx.doi.org/10.1016/S0020-0190(99)00017-4

Affiliations: Computer Science, The University of Calgary, 2500 University Drive N.W., Calgary, Alberta, T2N 1N4, Canada

Publication date: March 12, 1999

els/00200190/1999/00000069/00000005/art00017
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more