Minimizing the Diameter of a Network Using Shortcut Edges
From MaRDI portal
Publication:3569910
DOI10.1007/978-3-642-13731-0_39zbMath1285.68119OpenAlexW1580292412MaRDI QIDQ3569910
Erik D. Demaine, Morteza Zadimoghaddam
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/62215
Related Items (21)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Strengthening ties towards a highly-connected world ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ Impact of the topology of urban streets on mobility optimization ⋮ Improving the Betweenness Centrality of a Node by Adding Links ⋮ Almost optimal algorithms for diameter-optimally augmenting trees ⋮ Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches ⋮ Augmenting graphs to minimize the radius ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Finding diameter-reducing shortcuts in trees ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ Augmenting graphs to minimize the diameter ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Location of speed-up subnetworks ⋮ Optimization of the critical diameter and average path length of social networks ⋮ An improved algorithm for diameter-optimally augmenting paths in a metric space ⋮ Unnamed Item ⋮ Using shortcut edges to maximize the number of triangles in graphs ⋮ On the maximum betweenness improvement problem ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
This page was built for publication: Minimizing the Diameter of a Network Using Shortcut Edges
