Decreasing the diameter of bounded degree graphs
From MaRDI portal
Publication:4521485
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y" /><161::AID-JGT1>3.0.CO;2-Y 10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-YzbMath0966.05024OpenAlexW4245766261MaRDI QIDQ4521485
Noga Alon, Miklós Ruszinkó, András Gyárfás
Publication date: 19 December 2000
Full work available at URL: https://doi.org/10.1002/1097-0118(200011)35:3<161::aid-jgt1>3.0.co;2-y
Related Items (21)
Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ A Polynomial-Time Algorithm for Outerplanar Diameter Improvement ⋮ Almost optimal algorithms for diameter-optimally augmenting trees ⋮ A polynomial-time algorithm for outerplanar diameter improvement ⋮ Vertex fusion under diameter constraints ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ Augmenting graphs to minimize the diameter ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Decompositions into Subgraphs of Small Diameter ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ An improved algorithm for diameter-optimally augmenting paths in a metric space ⋮ Unnamed Item ⋮ Augmenting forests to meet odd diameter requirements ⋮ A linear-time algorithm for radius-optimally augmenting paths in a metric space ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Vertex fusion under distance constraints ⋮ A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements ⋮ Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees ⋮ Reducing the diameter of a unit disk graph via node addition
Cites Work
This page was built for publication: Decreasing the diameter of bounded degree graphs
