The following pages link to The multi-multiway cut problem (Q884458):
Displaying 6 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
