An Oz.ast;(1.84^k)parameterized algorithm for the multiterminal cut problem

Keyphrases

• Parameterized Algorithms 100%
• Multi-terminal 100%
• Cutting Problem 100%
• Terminal Vertices 100%
• Submodular Function 50%
• Total Weight 50%
• Time Algorithm 50%
• Maximum Volume 50%
• Vertex Set 50%
• Crossing Edges 50%
• Tree Search 50%
• Bounded Search Tree 50%
• Minimum S-t Cut 50%
• Distinct Parts 50%
• Branching Scheme 50%
• 3-terminal 50%
• Isolating Cuts 50%

Mathematics

• Terminal Vertex 100%
• Edge 100%
• Total Weight 50%
• Integer 50%

Computer Science

• Terminal Vertex 100%
• Tree Algorithm 50%