Pages that link to "Item:Q2784466"
From MaRDI portal
The following pages link to A 2-Approximation Algorithm for the Directed Multiway Cut Problem (Q2784466):
Displayed 12 items.
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5743512) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)