scientific article; zbMATH DE number 7561394
From MaRDI portal
Publication:5091032
DOI10.4230/LIPIcs.ISAAC.2018.40MaRDI QIDQ5091032
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Algorithms for radius-optimally augmenting trees in a metric space ⋮ Algorithms for radius-optimally augmenting trees in a metric space ⋮ A linear-time algorithm for radius-optimally augmenting paths in a metric space ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ 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
Cites Work
- Unnamed Item
- Augmenting graphs to minimize the diameter
- Finding the upper envelope of n line segments in O(n log n) time
- 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
- Augmenting trees to meet biconnectivity and diameter constraints
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- The parametric complexity of graph diameter augmentation
- Augmenting Outerplanar Graphs to Meet Diameter Requirements
- Fast Algorithms for Diameter-Optimally Augmenting Paths
- Minimizing the Diameter of a Network Using Shortcut Edges
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Diameter increase caused by edge deletion
- Decreasing the diameter of bounded degree graphs
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
- Diameter bounds for altered graphs
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
- An improved algorithm for diameter-optimally augmenting paths in a metric space
This page was built for publication:
