Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
- 18 June 1998
- book chapter
- Published by Springer Nature
- p. 137-152
- https://doi.org/10.1007/3-540-69346-7_11
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Approximation through multicommodity flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- 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