Vertex fusion under distance constraints (Q1039434): Difference between revisions

@@ 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 @@
+Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Mixed covering of trees and the augmentation problem with odd diameter constraints
+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 @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting forests to meet odd diameter requirements
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+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 @@
+<i>R</i>             -Domination in Graphs
@@ Property / cites work: <i>R</i> -Domination in Graphs / rank @@
+Normal rank