"Fast and accurate estimation of shortest paths in large graphs."

Andrey Gubichev et al. (2010)

> Home

Details and statistics

DOI: 10.1145/1871437.1871503

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cikm/GubichevBSW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/GubichevBSW10
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seufert, Gerhard Weikum:
Fast and accurate estimation of shortest paths in large graphs. CIKM 2010: 499-508

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.