Pages that link to "Item:Q510569"
From MaRDI portal
The following pages link to Shortcut sets for plane Euclidean networks (extended abstract) (Q510569):
Displaying 9 items.
- Euclidean chains and their shortcuts (Q391221) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Shortcuts for the circle (Q670711) (← links)
- How to take short cuts (Q1199128) (← 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)
- How to take shortcuts in Euclidean space: making a given set into a short quasi-convex set (Q2909058) (← links)
- (Q5136224) (← links)