A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.10.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2152306584
@@ Property / OpenAlex ID: W2152306584 / rank @@
+Normal rank
@@ Property / cites work @@
+Call control with \(k\) rejections
@@ Property / cites work: Call control with \(k\) rejections / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737541
@@ Property / cites work: Q4737541 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411277
@@ Property / cites work: Q4411277 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449192
@@ Property / cites work: Q4449192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Algorithmics for hard problems.
@@ Property / cites work: Algorithmics for hard problems. / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank