Vertex fusion under diameter constraints (Q3503481): 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 @@
+Vertex fusion under diameter constraints
@@ Property / cites work: Vertex fusion under diameter constraints / rank @@
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+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