Pages that link to "Item:Q4575662"
From MaRDI portal
The following pages link to Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs (Q4575662):
Displaying 16 items.
- Multi-budgeted directed cuts (Q786027) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- (Q4973881) (redirect page) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
