"Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks."

Ye Wang et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3448016.3452826

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sigmod/WangWKL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/WangWKL21
Ye Wang, Qing Wang, Henning Koehler, Yu Lin:
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks. SIGMOD Conference 2021: 1946-1958

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.