Solving partition problems almost always requires pushing many vertices around

Keyphrases

• Partition Problem 100%
• Bipartition 100%
• Cluster Graph 66%
• Fixed-parameter Algorithms 66%
• Triviality 33%
• Vertex Set 33%
• Graph Problems 33%
• Kernelization 33%
• Process Yield 33%
• Algorithmic Approach 33%
• Disjoint Union 33%
• Bipartite Graph 33%
• Number of Clusters 33%
• Poly(A) 33%
• Split Graphs 33%
• Polynomial Kernel 33%
• Problem Kernel 33%
• Property A 33%
• Forbidden Induced Subgraphs 33%
• Property B 33%
• 3-colorable Graphs 33%
• Monopolar Graph 33%
• Clique Graph 33%
• Polynomial Problem 33%

Mathematics

• Polynomial 100%
• Kernelization 50%
• Free Graph 50%
• Induced Subgraph 50%
• Clique 50%