A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2019.05.014
@@ Property / DOI: 10.1016/j.tcs.2019.05.014 / rank @@
-Normal rank
@@ Property / cites work @@
+Approximability of partitioning graphs with supply and demand
+Normal rank
@@ Property / cites work @@
+PARTITIONING TREES OF SUPPLY AND DEMAND
@@ Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs of supply and demand
@@ Property / cites work: Partitioning graphs of supply and demand / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic method for solving the problem of partitioning graphs with supply and demand
+Normal rank
@@ Property / cites work @@
+Spanning Distribution Trees of Graphs
@@ Property / cites work: Spanning Distribution Trees of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Network Flows
@@ Property / cites work: Parametric Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric power supply networks
@@ Property / cites work: Parametric power supply networks / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127839294
@@ Property / Wikidata QID: Q127839294 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2019.05.014
@@ Property / DOI: 10.1016/J.TCS.2019.05.014 / rank @@
+Normal rank