Pages that link to "Item:Q987378"
From MaRDI portal
The following pages link to Simple and improved parameterized algorithms for multiterminal cuts (Q987378):
Displaying 24 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
- (Q5002797) (← links)
- (Q5089231) (← links)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
- (Q5743512) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
