"Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors ..."

Victor Teixeira de Almeida, Ralf Hartmut Güting (2006)

> Home

Details and statistics

DOI: 10.1145/1141277.1141291

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/sac/AlmeidaG06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sac/AlmeidaG06
Victor Teixeira de Almeida, Ralf Hartmut Güting:
Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases. SAC 2006: 58-62

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.