The following pages link to (Q3341921):
Displaying 13 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
