The following pages link to (Q5369529):
Displaying 20 items.
- Shortcut sets for plane Euclidean networks (extended abstract) (Q510569) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- Geometric path problems with violations (Q1709576) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← 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)
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
- (Q5091005) (← links)
- (Q5091032) (← links)
- (Q5111738) (← links)
- (Q5136224) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
- An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← links)
- A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5919104) (← links)
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q6110070) (← links)
