An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

This publication has 10 references indexed in Scilit:

• Parameterized graph separation problems
  Theoretical Computer Science, 2006
• Markov random fields with efficient approximations
  2002
• A 2-Approximation Algorithm for the Directed Multiway Cut Problem
  SIAM Journal on Computing, 2001
• An Improved Approximation Algorithm for MULTIWAY CUT
  Journal of Computer and System Sciences, 2000
• Rounding algorithms for a geometric embedding of minimum multiway cut
  1999
• Finding maximum flows in undirected graphs seems easier than bipartite matching
  1998
• The Complexity of Multiterminal Cuts
  SIAM Journal on Computing, 1994
• Multi-way VLSI Circuit Partitioning Based On Dual Net Representation
  1994
• The optimal multiterminal cut problem
  1991
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
  IEEE Transactions on Software Engineering, 1977