Pages that link to "Item:Q2391180"
From MaRDI portal
The following pages link to An improved parameterized algorithm for the minimum node multiway cut problem (Q2391180):
Displaying 41 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness (Q2835687) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002776) (← links)
- (Q5002797) (← links)
- (Q5009483) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
