Reachability and Distance Queries via 2-Hop Labels
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2119758
- Network Discovery and Verification with Distance Queries
- Distance labeling in graphs (extended abstract)
- Robust distance queries on massive networks
- scientific article; zbMATH DE number 1875437
- On approximate distance labels and routing schemes with affine stretch
- Hardness of exact distance queries in sparse graphs through hub labeling
- scientific article; zbMATH DE number 1409224
Cited in
(28)- Randomized proof-labeling schemes
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Eccentricity queries and beyond using hub labels
- Reachability oracles for directed transmission graphs
- The hierarchical hub labeling is non-efficient
- Robust distance queries on massive networks
- On the complexity of hub labeling (extended abstract)
- VC-dimension and shortest path algorithms
- Utilizing multilevel community center labels for distance querying in large graphs
- On the power of tree-depth for fully polynomial FPT algorithms
- Access, rank, and select in grammar-compressed strings
- Lower bounds in the preprocessing and query phases of routing algorithms
- Fully Dynamic 2-Hop Cover Labeling
- scientific article; zbMATH DE number 2119758 (Why is no real title available?)
- Computing constrained shortest-paths at scale
- Exploiting hopsets: improved distance oracles for graphs of constant highway dimension and beyond
- Shortest-path queries in static networks
- scientific article; zbMATH DE number 7651159 (Why is no real title available?)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
- Reachability in big graphs: a distributed indexing and querying approach
- Customizable hub labeling: properties and algorithms
- Exact and approximate hierarchical hub labeling
- The complexity of landmark hub labeling
- Parameterized upper bounds for path-consistent hub labeling
- Insights into (k,)-shortcutting algorithms
- Approximating densest subgraph in geometric intersection graphs
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
- Approximate shortest paths guided by a small index
This page was built for publication: Reachability and Distance Queries via 2-Hop Labels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429688)
