SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 1, 1995, Pages 51-54

A tight upper bound on the cover time for random walks on graphs

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990631366 PISSN: 10429832 EISSN: 10982418 Source Type: Journal
DOI: 10.1002/rsa.3240060106 Document Type: Article

Times cited : (77)

References (8)

1
- 84990717398
- Reversible Markov chains and random walks on graphs, Draft of first six chapters of book, January 26
- (1993)
- Aldous, D.J.¹

2
- 85045415700
- Random walks, universal traversal sequences, and the complexity of maze problems, 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October
- (1979) , pp. 218-223
- Aleliunas, R.¹ Karp, R.M.² Lipton, R.J.³ Lovász, L.⁴ Rackoff, C.⁵

3
- 84990669544
- Maximum hitting times for random walks on graphs
- (1990) Random Structures & Algorithms , vol.1 , pp. 263-276
- Brightwell, G.¹ Winkler, P.²

4
- 0024864589
- The electrical resistance of a graph captures its commute and cover times, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, WA. May
- (1989) , pp. 574-586
- Chandra, A.¹ Raghavan, P.² Ruzzo, W.³ Smolensky, R.⁴ Tiwari, P.⁵

6
- 0003831025
- The Mathematical Association of America
- (1984) Random Walks and Electrical Networks
- Doyle, P.G.¹ Snell, J.L.²

7
- 0037734943
- The average impedance of an electrical network
- Edwards Brothers, Ann Arbor
- (1949) Contributions to Applied Mechanics (Reissner Anniversary Volume) , pp. 333-340
- Foster, R.¹

8
- 0001418604
- Random walks and the effective resistance of networks
- (1991) J. Theor. Probab. , vol.4 , pp. 101-109
- Tetali, P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.