Pages that link to "Item:Q4948512"
From MaRDI portal
The following pages link to Proximity-preserving labeling schemes (Q4948512):
Displaying 30 items.
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- New pairwise spanners (Q1693988) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← 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)
- On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- (Q5092373) (← links)
- (Q5136231) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- The space complexity of sum labelling (Q6056630) (← links)
