Pages that link to "Item:Q5494963"
From MaRDI portal
The following pages link to The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable (Q5494963):
Displaying 19 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs (Q2082190) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Euler Digraphs (Q3120436) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- (Q5002797) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5077149) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
