On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689): Difference between revisions

@@ Property / cites work @@
+Oriented graph coloring
@@ Property / cites work: Oriented graph coloring / 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 @@
+The network inhibition problem
@@ Property / cites work: The network inhibition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Increasing the Weight of Minimum Spanning Trees
@@ Property / cites work: Increasing the Weight of Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971521
@@ Property / cites work: Q3971521 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving Minimum Cost Spanning Trees by Upgrading Nodes
+Normal rank
@@ Property / cites work @@
+Upgrading arcs to minimize the maximum travel time in a network
+Normal rank
@@ Property / cites work @@
+Upgrading trees under diameter and budget constraints
+Normal rank
@@ Property / cites work @@
+Augmenting forests to meet odd diameter requirements
+Normal rank
@@ Property / cites work @@
+A simple heuristic for the p-centre problem
@@ Property / cites work: A simple heuristic for the p-centre problem / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for the p-center problem in graphs
@@ Property / cites work: A heuristic for the p-center problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank