No article text was recorded for this version.
2-hop distance labeling
Version 1 of 157 papers76 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths
- Blog: An Experimental Study on Hub Labeling based Shortest Path Algorithms
- Blog: IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying
- Blog: Relational Approach for Shortest Path Discovery over Large Graphs
- Blog: Fast Top-<i>k</i> Distance Retrieval for Network Structural Proximity Features
- Blog: Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
- Blog: Ultrafast Euclidean Shortest Path Computation Using Hub Labeling
- Blog: A General-Purpose Query-Centric Framework for Querying Big Graphs
- Blog: On k-skip shortest paths
- Blog: Querying Shortest Paths on Time Dependent Road Networks
- Blog: Proximity Search in Databases
- Blog: Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
- Blog: CANDS: Continuous Optimal Navigation via Distributed Stream Processing
- Blog: Keyword Search on Large Graphs: A Survey
- Blog: Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement
- Blog: Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
- Blog: Distributed Spatial Keyword Querying on Road Networks
- Blog: Vertex labeling and routing in expanded Apollonian networks
- Blog: HubGT: Fast Graph Transformer with Decoupled Hierarchy Labeling
- Blog: An Efficient Index for Reachability Queries in Public Transport Networks
- Blog: Biologically Inspired Neural Path Finding
- Blog: A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem
- Blog: Canonical Orderings on Grids
- Blog: Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries
- Blog: Fast and exact geodesic computation using Edge-based Windows Grouping
- Blog: New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
- Blog: Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
- Blog: Generalized Sobolev Transport for Probability Measures on a Graph
- Blog: Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks
- Blog: High-Performance Reachability Query Processing under Index Size Restrictions
- Blog: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
- Blog: Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks
- Blog: Active Learning of Convex Halfspaces on Graphs
- Blog: Fast Network K-function-based Spatial Analysis
- Blog: Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation
- Blog: Two-point L1 shortest path queries in the plane
- Blog: DBL: Efficient Reachability Queries on Dynamic Graphs
- Blog: Approximation Algorithm for Shortest Path in Large Social Networks
- Blog: K-Reach: Who is in Your Small World
- Blog: An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
- Blog: Bootstrapping Dynamic Distance Oracles
- Blog: Distance oracles in edge-labeled graphs
- Blog: Indexing Techniques for Graph Reachability Queries
- Blog: Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond
- Blog: Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks
- Blog: High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks
- Blog: TopCom: Index for Shortest Distance Query in Directed Graph
- Blog: BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale
- Blog: An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
- Blog: Approximating Probabilistic Group Steiner Trees in Graphs
- Blog: Simple, Fast, and Scalable Reachability Oracle
- Blog: A linear-time algorithm for radius-optimally augmenting paths in a metric space
- Blog: TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks
- Blog: A Reachability Index for Recursive Label-Concatenated Graph Queries
- Blog: GXQuery: Extending XQuery for Querying Graph-structured XML Data
- Blog: Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
- Blog: Improved algorithm for finding next-to-shortest paths
History & citation
Current · Permanent link
- Hub Labeling for Fast Shortest Path Queries merged into this direction (57% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_2_hop_distance_labeling_1c933fce,
title = {2-hop distance labeling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/2-hop-distance-labeling/rdr_1c933fceaea44d259fce27b8f4da3eb1},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_2_hop_distance_labeling_1c933fce_v1,
title = {2-hop distance labeling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/2-hop-distance-labeling/rdr_1c933fceaea44d259fce27b8f4da3eb1/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}