Pages that link to "Item:Q3638883"
From MaRDI portal
The following pages link to Minimizing Average Shortest Path Distances via Shortcut Edge Addition (Q3638883):
Displaying 18 items.
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (Q781014) (← links)
- Strengthening ties towards a highly-connected world (Q832669) (← 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)
- Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
- Some results about the inset edge and average distance of trees (Q2104937) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← 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)
- Network structure optimization for social networks by minimizing the average path length (Q2674429) (← 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)
- Mechanism design for building optimal bridges between regions (Q6636098) (← links)
