Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Keyphrases

• Polynomial Kernel 100%
• Partition Problem 100%
• Problem Recognition 100%
• Cluster Graph 100%
• Graph Problems 50%
• Triviality 50%
• Number of Clusters 50%
• Kernelization 50%
• Fixed-parameter Tractability 50%
• Bipartite Graph 50%
• Split Graphs 50%
• Disjoint Union 50%
• Vertex Set 50%
• Algorithmic Approach 50%
• Forbidden Induced Subgraphs 50%
• Fixed-parameter Algorithms 50%
• Monopolar Graph 50%
• Clique Graph 50%
• 3-colorable Graphs 50%

Mathematics

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