"Derandomizing random walks in undirected graphs using locally fair ..."

Colin Cooper et al. (2011)

> Home

Details and statistics

DOI: 10.1007/S00446-011-0138-4

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dc/CooperIKK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dc/CooperIKK11
Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.