Complete partitions of graphs

Keyphrases

• Graph Partitioning 100%
• Complete Partitions 100%
• Polynomial-time Algorithm 33%
• Tight 16%
• NP-hard 16%
• Tight Lower Bound 16%
• Vertex Set 16%
• Tight Upper Bound 16%
• Class number 16%

Mathematics

• Polynomial Time 100%
• Edge 50%
• Approximability 50%
• Upper Bound 50%
• Lower and upper bounds 50%