ReHub

DOI10.1145/2990192zbMath1365.68354arXiv1504.01497OpenAlexW2235409983MaRDI QIDQ5266603

Dieter Pfoser, Alexandros Efentakis

Publication date: 16 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01497

zbMATH Keywords

graph algorithms\(k\)-nearest neighborsquery processingRNNhub labels\(k\)NNR\(k\)NNReHub algorithmreverse \(k\)-nearest neighbors

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Hierarchical Hub Labelings for Shortest Paths
• Robust Distance Queries on Massive Networks
• GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Encyclopedia of Database Systems
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Distance labeling in graphs
• Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling
• Better Approximation of Betweenness Centrality
• Algorithms and Data Structures

This page was built for publication: ReHub