Pages that link to "Item:Q2802977"
From MaRDI portal
The following pages link to A Parameterized Algorithm for Mixed-Cut (Q2802977):
Displaying 8 items.
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- A generalized \(\alpha\)-cut (Q1602896) (← links)
- On structural parameterizations of the matching cut problem (Q1708644) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5875545) (← links)