The following pages link to (Q5091032):
Displaying 11 items.
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- Minimizing the continuous diameter when augmenting a tree with a shortcut (Q2405291) (← links)
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
- (Q5111750) (← links)
- Algorithms and Data Structures (Q5394257) (← 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)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← 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)