Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- 1 September 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 48 (2) , 333-359
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Directed Tree-WidthJournal of Combinatorial Theory, Series B, 2001
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Two-Commodity FlowJournal of the ACM, 1978
- Letter to the Editor—The Maximum Capacity Route ProblemOperations Research, 1961
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956