Pages that link to "Item:Q494792"
From MaRDI portal
The following pages link to Augmenting graphs to minimize the diameter (Q494792):
Displaying 25 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← 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 polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- (Q2872102) (redirect page) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
- Impact of the topology of urban streets on mobility optimization (Q5055377) (← links)
- (Q5091032) (← 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 (Q5970916) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q6110070) (← links)
- Augmenting graphs to minimize the radius (Q6114475) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
