"A Markov chain model for the search time for max degree nodes in a graph ..."

Jonathan Stokes, Steven Weber (2016)

> Home

Details and statistics

DOI: 10.1109/CISS.2016.7460544

access: closed

type: Conference or Workshop Paper

metadata version: 2019-11-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ciss/StokesW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciss/StokesW16
Jonathan Stokes, Steven Weber:
A Markov chain model for the search time for max degree nodes in a graph using a biased random walk. CISS 2016: 448-453

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.