Pages that link to "Item:Q1583693"
From MaRDI portal
The following pages link to A faster algorithm for computing minimum 5-way and 6-way cuts in graphs (Q1583693):
Displaying 6 items.
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Efficient Algorithms for the k Smallest Cuts Enumeration (Q3511355) (← links)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)