The following pages link to (Q4952694):
Displaying 4 items.
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- Finding minimum 3-way cuts in hypergraphs (Q765477) (← links)
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
