Pages that link to "Item:Q2862552"

The following pages link to Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552):

Displaying 10 items.

• Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
• A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
• A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
• (Q5091032) (← 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 (Q5970916) (← links)