Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
From MaRDI portal
Publication:5919104
DOI10.1007/978-3-030-68211-8_3OpenAlexW3135663958MaRDI QIDQ5919104
No author found.
Publication date: 4 October 2021
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09591
Related Items
Algorithms for radius-optimally augmenting trees in a metric space ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
Cites Work
- Unnamed Item
- Unnamed Item
- Computation of the center and diameter of outerplanar graphs
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- Fast Algorithms for Diameter-Optimally Augmenting Paths
- A simple linear-time algorithm for computing the center of an interval graph
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Faster All-Pairs Shortest Paths via Circuit Complexity
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
- An improved algorithm for diameter-optimally augmenting paths in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
