Distance labeling in graphs
From MaRDI portal
Recommendations
Cited in
(75)- A note on models for graph representations
- Localized and compact data-structure for comparability graphs
- Bimagic vertex labelings
- Impact of knowledge on election time in anonymous networks
- A note on exact distance labeling
- Distance estimation and object location via rings of neighbors
- General compact labeling schemes for dynamic trees
- Constrained-path labellings on graphs of bounded clique-width
- Randomized proof-labeling schemes
- Advice complexity of treasure hunt in geometric terrains
- Optimal centrality computations within bounded clique-width graphs
- Distance labeling schemes for \(K_4\)-free bridged graphs
- An efficient noisy binary search in graphs via Median approximation
- Eccentricity queries and beyond using hub labels
- Distance and routing labeling schemes for cube-free median graphs
- Sublinear search spaces for shortest path planning in grid and road networks
- How to use spanning trees to navigate in graphs
- Proof labeling schemes
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Labeling schemes for weighted dynamic trees
- The hierarchical hub labeling is non-efficient
- Informative labeling schemes for graphs
- Topology recognition with advice
- Finding the size and the diameter of a radio network using short labels
- Lower and upper bounds for deterministic convergecast with labeling schemes
- Distance labeling in graphs (extended abstract)
- On the complexity of hub labeling (extended abstract)
- VC-dimension and shortest path algorithms
- How to Use Spanning Trees to Navigate in Graphs
- Distance Labeling for Permutation Graphs
- A simple and optimal ancestry labeling scheme for trees
- Drawing maps with advice
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- Simpler, faster and shorter labels for distances in graphs
- Distance labeling schemes for trees
- Near-optimal compression for the planar graph metric
- Adjacency labeling schemes and induced-universal graphs
- Graph distance‐dependent labeling related to code assignment in computer networks
- scientific article; zbMATH DE number 1830738 (Why is no real title available?)
- scientific article; zbMATH DE number 1875437 (Why is no real title available?)
- scientific article; zbMATH DE number 1420896 (Why is no real title available?)
- Proximity-preserving labeling schemes
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Isometric universal graphs
- Near-optimal distance emulator for planar graphs
- List graphs and distance-consistent node labelings
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Exploiting hopsets: improved distance oracles for graphs of constant highway dimension and beyond
- Distance labeling schemes for cube-free median graphs
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
- Decomposing a graph into shortest paths with bounded eccentricity
- Distance Labels with Optimal Local Stretch
- Labeling schemes for bounded degree graphs
- Shortest-path queries in static networks
- Forbidden-set distance labels for graphs of bounded doubling dimension
- ReHub: extending hub labels for reverse k-nearest neighbor queries on large-scale networks
- Inductive computations on graphs defined by clique-width expressions
- Distributed Relationship Schemes for Trees
- Fault-tolerant distance labeling for planar graphs
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Fault-tolerant distance labeling for planar graphs
- Four shades of deterministic leader election in anonymous networks
- Better distance labeling for unweighted planar graphs
- Labelings vs. embeddings: on distributed and prioritized representations of distances
- Implicit representation of relations
- Edge exploration of anonymous graph by mobile agent with external help
- Distance labeling for families of cycles
- A note on distance labeling of graphs
- Closing the gap: minimum space optimal time distance labeling scheme for interval graphs
- Restorable shortest path tiebreaking for edge-faulty graphs
- Efficient distributed computation of distance sketches in networks
- Decomposing a graph into shortest paths with bounded eccentricity
- Better distance labeling for unweighted planar graphs
- Fast rendezvous with advice
- Fast deterministic distributed algorithms for sparse spanners
This page was built for publication: Distance labeling in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826764)
