Pages that link to "Item:Q848633"
From MaRDI portal
The following pages link to Collective tree spanners in graphs with bounded parameters (Q848633):
Displaying 9 items.
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← 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)
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences (Q2927646) (← links)
- Algorithm Theory - SWAT 2004 (Q5315403) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
