The following pages link to The multi-multiway cut problem (Q884458):
Displayed 12 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)
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- (Q5743380) (← links)
- A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)