scientific article; zbMATH DE number 7278014
From MaRDI portal
Publication:5136224
DOI10.4230/LIPIcs.ISAAC.2017.9zbMath1457.68278MaRDI QIDQ5136224
Sang Won Bae, Joachim Gudmundsson, Mark T. de Berg, Otfried Schwarzkopf, Christos Levcopoulos
Publication date: 25 November 2020
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 (5)
Computing optimal shortcuts for networks ⋮ Unnamed Item ⋮ A linear-time algorithm for radius-optimally augmenting paths in a metric space ⋮ Shortcut sets for the locus of plane Euclidean networks ⋮ A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Euclidean chains and their shortcuts
- Augmenting graphs to minimize the diameter
- Shortcut sets for plane Euclidean networks (extended abstract)
- Improved approximability and non-approximability results for graph diameter decreasing problems
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Bounded-diameter minimum-cost graph problems
- Fast Algorithms for Diameter-Optimally Augmenting Paths
- Diameter increase caused by edge deletion
- Diameter bounds for altered graphs
This page was built for publication:
