The following pages link to (Q4944965):
Displaying 19 items.
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Proximity-preserving labeling schemes (Q4948512) (← links)
- (Q5009588) (← links)
- List graphs and distance-consistent node labelings (Q5009976) (← links)
- Lossless Prioritized Embeddings (Q5088604) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
