Minimizing the continuous diameter when augmenting a tree with a shortcut

DOI10.1007/978-3-319-62127-2_26MaRDI QIDQ2405291zbMATH OpenOpenAlexFDO

Authors Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel Smid

Publication date 22 September 2017

Full work available at URL https://doi.org/10.1007/978-3-319-62127-2_26

zbMATH Keywords

continuous diameter minimizationnetwork augmentation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
• scientific article; zbMATH DE number 6792403
• Minimizing diameters of dynamic trees
• Augmenting trees to meet biconnectivity and diameter constraints
• Trees with given diameter minimizing the augmented Zagreb index and maximizing the ABC index
• Almost optimal algorithms for diameter-optimally augmenting trees
• Almost optimal algorithms for diameter-optimally augmenting trees
• Fast algorithms for diameter-optimally augmenting paths and trees
• Approximating minimum k-section in trees with linear diameter

Cited in

(16)

• Computing optimal shortcuts for networks
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
• Shortcut sets for the locus of plane Euclidean networks
• A near-optimal algorithm for finding an optimal shortcut of a tree
• A linear-time algorithm for discrete radius optimally augmenting paths in a metric space
• Augmenting Geometric Graphs with Matchings
• Computing optimal shortcuts for networks
• Almost optimal algorithms for diameter-optimally augmenting trees
• Algorithms and Computation
• scientific article; zbMATH DE number 6792403 (Why is no real title available?)
• Fast algorithms for diameter-optimally augmenting paths and trees
• A linear-time algorithm for radius-optimally augmenting paths in a metric space
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
• Algorithms for radius-optimally augmenting trees in a metric space
• Algorithms for radius-optimally augmenting trees in a metric space

This page was built for publication: Minimizing the continuous diameter when augmenting a tree with a shortcut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2405291)