Publication:4284253

zbMath0794.68117MaRDI QIDQ4284253

Gerhard J. Woeginger, Petra Scheffler, Klaus Jansen

Publication date: 24 March 1994

zbMATH Keywords

NP-completeness; polynomial time algorithms; disjoint union of cliques

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Approximation results for the optimum cost chromatic partition problem, On the b-coloring of cographs and \(P_{4}\)-sparse graphs, The maximum vertex coverage problem on bipartite graphs