The following pages link to Distance labeling in graphs (Q4826764):
Displaying 14 items.
- Distance Labels with Optimal Local Stretch (Q5167730) (← 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)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
- Implicit representation of relations (Q6185606) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)