Pages that link to "Item:Q5384465"
From MaRDI portal
The following pages link to Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465):
Displaying 13 items.
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
- Minimizing the continuous diameter when augmenting a tree with a shortcut (Q2405291) (← links)
- Upgrading trees under diameter and budget constraints (Q4797944) (← links)
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
- (Q5091032) (← links)
- Algorithms and Data Structures (Q5394257) (← links)
- An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← 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)
- Augmenting graphs to minimize the radius (Q6114475) (← links)