Pages that link to "Item:Q419502"
From MaRDI portal
The following pages link to Compact and low delay routing labeling scheme for unit disk graphs (Q419502):
Displaying 12 items.
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Plane hop spanners for unit disk graphs: simpler and better (Q2206719) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- (Q5115792) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Compact Routing in Unit Disk Graphs (Q6065413) (← links)
- Routing among convex polygonal obstacles in the plane (Q6610091) (← links)