An improved parameterized algorithm for the minimum node multiway cut problem
From MaRDI portal
Publication:2391180
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 176254 (Why is no real title available?)
- scientific article; zbMATH DE number 1775390 (Why is no real title available?)
- A 2-approximation algorithm for the directed multiway cut problem
- An improved approximation algorithm of MULTIWAY CUT.
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Parameterized graph separation problems
- The Complexity of Multiterminal Cuts
Cited in
(42)- An improved fixed-parameter algorithm for max-cut parameterized by crossing number
- Parameterized algorithms for zero extension and metric labelling problems
- Multicut Is FPT
- Balanced judicious bipartition is fixed-parameter tractable
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On the parameterized complexity of finding separators with non-hereditary properties
- Quick separation in chordal and split graphs
- Subset feedback vertex set on graphs of bounded independent set size
- The critical node detection problem in networks: a survey
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Parameterized tractability of multiway cut with parity constraints
- On the parameterized complexity of separating certain sources from the target
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- Linear time parameterized algorithms for subset feedback vertex set
- An improved parameterized algorithm for treewidth
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- Subset feedback vertex set on graphs of bounded independent set size
- FPT algorithms for path-transversal and cycle-transversal problems
- Clique Cover and Graph Separation
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- How to Cut a Graph into Many Pieces
- Faster exact algorithms for some terminal set problems
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
- On the generalized multiway cut in trees problem
- A faster parameterized algorithm for Group Feedback Edge Set
- An improved approximation algorithm of MULTIWAY CUT.
- Brief announcement: Bounded-degree cut is fixed-parameter tractable
- Designing FPT algorithms for cut problems using randomized contractions
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- Parameterized complexity of critical node cuts
- Minimum Bisection Is Fixed-Parameter Tractable
- Parameterized complexity of deletion to scattered graph classes
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- Hitting selected (odd) cycles
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
- Odd cycle transversal in mixed graphs
- The multi-terminal vertex separator problem: polytope characterization and TDI-ness
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
This page was built for publication: An improved parameterized algorithm for the minimum node multiway cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391180)
