An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

DOI10.1007/978-3-540-73951-7_43zbMATH Open1209.68615OpenAlexW1604791202MaRDI QIDQ3603552FDOQ3603552

Jianer Chen, Songjian Lu, Yang Liu

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (13)

• Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
• What’s Next? Future Directions in Parameterized Complexity
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems
• Clustering with Local Restrictions
• Improved algorithms for feedback vertex set problems
• Almost 2-SAT is fixed-parameter tractable
• An improved approximation algorithm of MULTIWAY CUT.
• Simple and improved parameterized algorithms for multiterminal cuts
• Solution methods for the vertex variant of the network system vulnerability analysis problem
• An improved fixed-parameter algorithm for max-cut parameterized by crossing number
• FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
• Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
• Important Separators and Parameterized Algorithms

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 Q3603552)