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

@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C12
@@ Property / Mathematics Subject Classification ID: 05C12 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6048256
@@ Property / zbMATH DE Number: 6048256 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+extremal graph theory
@@ Property / zbMATH Keywords: extremal graph theory / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network upgrading
@@ Property / zbMATH Keywords: network upgrading / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge coloring
@@ Property / zbMATH Keywords: edge coloring / 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.1016/j.disopt.2010.09.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2052434346
@@ Property / OpenAlex ID: W2052434346 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:429689