A Tight Upper Bound on the Cover Time for Random Walks on Graphs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Uriel Feige. A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms, 6(1):51-54, 1995.

@article{Feige95,
  title = {A Tight Upper Bound on the Cover Time for Random Walks on Graphs},
  author = {Uriel Feige},
  year = {1995},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Feige95},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {6},
  number = {1},
  pages = {51-54},
}

runs on WebDSL