Pages that link to "Item:Q3569910"
From MaRDI portal
The following pages link to Minimizing the Diameter of a Network Using Shortcut Edges (Q3569910):
Displayed 21 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- Optimization of the critical diameter and average path length of social networks (Q2012776) (← links)
- Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Location of speed-up subnetworks (Q2259045) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- Impact of the topology of urban streets on mobility optimization (Q5055377) (← links)
- (Q5091032) (← 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 (Q5970916) (← links)
- Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
- Algorithms for radius-optimally augmenting trees in a metric space (Q6110070) (← links)
- Augmenting graphs to minimize the radius (Q6114475) (← links)
- Finding diameter-reducing shortcuts in trees (Q6179408) (← links)