"Finding paths in sparse random graphs requires many queries."

Asaf Ferber et al. (2017)

> Home

Details and statistics

DOI: 10.1002/RSA.20680

access: closed

type: Journal Article

metadata version: 2017-06-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/FerberKSV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/FerberKSV17
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017)

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.