Pages that link to "Item:Q2862207"
From MaRDI portal
The following pages link to Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset (Q2862207):
Displaying 30 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Finding all leftmost separators of size \(\le k\) (Q2149878) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- (Q5089249) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (Q5363762) (← links)
- Fixed-parameter tractability of multicut parameterized by the size of the cutset (Q5419117) (← links)
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset (Q5494921) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← 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)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components (Q6654121) (← links)
