Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826): Difference between revisions

@@ Property / author @@
+Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-47672-7_55
+Normal rank
@@ Property / OpenAlex ID @@
+W2293957677
@@ Property / OpenAlex ID: W2293957677 / rank @@
+Normal rank
@@ Property / cites work @@
+Decreasing the diameter of bounded degree graphs
@@ Property / cites work: Decreasing the diameter of bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximability and non-approximability results for graph diameter decreasing problems
+Normal rank
@@ Property / cites work @@
+A decomposition of multidimensional point sets with applications to             <i>k</i>             -nearest-neighbors and             <i>n</i>             -body potential fields
+Normal rank
@@ Property / cites work @@
+Augmenting trees to meet biconnectivity and diameter constraints
+Normal rank
@@ Property / cites work @@
+Diameter bounds for altered graphs
@@ Property / cites work: Diameter bounds for altered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Design networks with bounded pairwise distance
@@ Property / cites work: Design networks with bounded pairwise distance / rank @@
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Improving the Stretch Factor of a Geometric Network by Edge Augmentation
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+The parametric complexity of graph diameter augmentation
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs to Meet Diameter Requirements
+Normal rank
@@ Property / cites work @@
+Bounded-diameter minimum-cost graph problems
@@ Property / cites work: Bounded-diameter minimum-cost graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
+Normal rank
@@ Property / cites work @@
+Augmenting the Connectivity of Planar and Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Diameter increase caused by edge deletion
@@ Property / cites work: Diameter increase caused by edge deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the dilation of edge-augmented graphs in metric spaces
+Normal rank