scientific article; zbMATH DE number 6792403
From MaRDI portal
Publication:5369529
DOI10.4230/LIPIcs.SWAT.2016.27zbMath1378.68169arXiv1512.02257MaRDI QIDQ5369529
Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Michiel H. M. Smid
Publication date: 17 October 2017
Full work available at URL: https://arxiv.org/abs/1512.02257
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Algorithms for radius-optimally augmenting trees in a metric space, Almost optimal algorithms for diameter-optimally augmenting trees, Shortest paths in the plane with obstacle violations, Finding diameter-reducing shortcuts in trees, Minimizing the continuous diameter when augmenting a geometric tree with a shortcut, Geometric path problems with violations, Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees, Algorithms for radius-optimally augmenting trees in a metric space, Shortcuts for the circle, Shortcut sets for plane Euclidean networks (extended abstract), Computing optimal shortcuts for networks, An improved algorithm for diameter-optimally augmenting paths in a metric space, Unnamed Item, Unnamed Item, A linear-time algorithm for radius-optimally augmenting paths in a metric space, Unnamed Item, Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees, Unnamed Item, Shortcut sets for the locus of plane Euclidean networks, A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space, Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
