A fixed-parameter tractability result for multicommodity demand flow in trees
- 14 February 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 97 (3) , 109-114
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Invitation to Fixed-Parameter Algorithms2006
- Parameterized complexity for the skeptic2004
- Call control with k rejectionsJournal of Computer and System Sciences, 2003
- Parameterized Complexity1999
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1986