Pages that link to "Item:Q3597878"
From MaRDI portal
The following pages link to Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces (Q3597878):
Displaying 8 items.
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Computing the dilation of edge-augmented graphs in metric spaces (Q1037772) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Impact of the topology of urban streets on mobility optimization (Q5055377) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
