Pages that link to "Item:Q2290633"
From MaRDI portal
The following pages link to Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633):
Displaying 6 items.
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Parameterized complexity dichotomy for Steiner Multicut (Q2954992) (← links)
- (Q3840353) (← links)
- An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014) (← links)