The following pages link to Distance labeling in graphs (Q4826764):
Displaying 50 items.
- The hierarchical hub labeling is non-efficient (Q255772) (← links)
- Topology recognition with advice (Q259077) (← links)
- Drawing maps with advice (Q433400) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Bimagic vertex labelings (Q1711390) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Sublinear search spaces for shortest path planning in grid and road networks (Q2230730) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Lower and upper bounds for deterministic convergecast with labeling schemes (Q2693630) (← links)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- A Simple and Optimal Ancestry Labeling Scheme for Trees (Q3449505) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- (Q4944965) (← links)
- Proximity-preserving labeling schemes (Q4948512) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- (Q5009573) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5092347) (← links)
- (Q5092373) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- (Q5136231) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- ReHub (Q5266603) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
