On the cover time of random walks on graphs (Q1823548): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Jeffry Kahn / rank | |||
| Property / author | |||
| Property / author: Michael E. Saks / rank | |||
| Property / author | |||
| Property / author: Jeffry Kahn / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael E. Saks / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4111952 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01048274 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084768526 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the cover time of random walks on graphs |
scientific article |
Statements
On the cover time of random walks on graphs (English)
0 references
1989
0 references
random walks on arbitrary graphs
0 references
expected time needed for a randm walk on a finite graph to visit
0 references
every vertex
0 references
expected time needed for a randm walk on a finite graph to visit every vertex
0 references
