Pages that link to "Item:Q5470830"
From MaRDI portal
The following pages link to Collective tree spanners of graphs (Q5470830):
Displayed 14 items.
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Easy computation of eccentricity approximating trees (Q1741520) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Collective Tree Spanners for Unit Disk Graphs with Applications (Q2839219) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)