Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
From MaRDI portal
Publication:5970916
DOI10.1016/j.tcs.2021.09.014OpenAlexW3200425150MaRDI QIDQ5970916
No author found.
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09591
Related Items (3)
Almost optimal algorithms for diameter-optimally augmenting trees ⋮ Finding diameter-reducing shortcuts in trees ⋮ Algorithms for radius-optimally augmenting trees in a metric space
Cites Work
- Unnamed Item
- Unnamed Item
- Augmenting graphs to minimize the diameter
- Shortcuts for the circle
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Computation of the center and diameter of outerplanar graphs
- 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
- A simple linear-time algorithm for computing the center of an interval graph
- Minimizing the Diameter of a Network Using Shortcut Edges
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Diameter increase caused by edge deletion
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Decreasing the diameter of bounded degree graphs
- Faster All-Pairs Shortest Paths via Circuit Complexity
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
- Diameter bounds for altered graphs
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
This page was built for publication: Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
