The following pages link to Shortcutting Planar Digraphs (Q4862749):
Displaying 10 items.
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- (Q4607877) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- (Q5092347) (← links)
- (Q5116490) (← links)
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)