An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6594018
@@ Property / zbMATH DE Number: 6594018 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network design
@@ Property / zbMATH Keywords: network design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+trees
@@ Property / zbMATH Keywords: trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heaviest path problem
@@ Property / zbMATH Keywords: heaviest path problem / rank @@
+Normal rank

Revision as of 20:33, 27 June 2023