71- https://doi.org/10.1016/s0196-6774(03)00073-7
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Jul 4, 2003
- Journal of Algorithms
- Gruia Călinescu +2 more
Abstract
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- # Max SNP-hard
- # Unweighted Graphs
- # Polynomial-time Approximation Scheme
- # Multicut Problem
- # Bounded-degree Tree
- # Input Graph
- # Approximation Algorithm
- # Pairs Of Vertices
- # Minimum Set Of Edges
- # Linear-time Implementation
