Decreasing the diameter of bounded degree graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(24)- Vertex fusion under distance constraints
- How to decrease the diameter of triangle-free graphs
- Almost optimal algorithms for diameter-optimally augmenting trees
- Reducing the diameter of a unit disk graph via node addition
- A polynomial-time algorithm for outerplanar diameter improvement
- Augmenting forests to meet odd diameter requirements
- Augmenting outerplanar graphs to meet diameter requirements
- A polynomial-time algorithm for outerplanar diameter improvement
- Fast algorithms for diameter-optimally augmenting paths
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- Vertex fusion under diameter constraints
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Decreasing the diameter of cycles
- Decompositions into subgraphs of small diameter
- A linear-time algorithm for discrete radius optimally augmenting paths in a metric space
- Shortcutting directed and undirected networks with a degree constraint
- Almost optimal algorithms for diameter-optimally augmenting trees
- Fast algorithms for diameter-optimally augmenting paths and trees
- A linear-time algorithm for radius-optimally augmenting paths in a metric space
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Augmenting plane straight-line graphs to meet parity constraints
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
This page was built for publication: Decreasing the diameter of bounded degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521485)
