An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
From MaRDI portal
Publication:3603552
DOI10.1007/978-3-540-73951-7_43zbMath1209.68615MaRDI QIDQ3603552
Songjian Lu, Yang Liu, Jian'er Chen
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
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
Related Items
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs, Improved algorithms for feedback vertex set problems, Simple and improved parameterized algorithms for multiterminal cuts, Almost 2-SAT is fixed-parameter tractable, Solution methods for the vertex variant of the network system vulnerability analysis problem, What’s Next? Future Directions in Parameterized Complexity, Clustering with Local Restrictions, Important Separators and Parameterized Algorithms, Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters, FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs, Iterative Compression for Exactly Solving NP-Hard Minimization Problems