scientific article; zbMATH DE number 522858

MaRDI QIDQ4284253zbMATH OpenFDO

Authors Petra Scheffler, Gerhard J. Woeginger, Klaus Jansen

Publication date 24 March 1994

zbMATH Keywords

disjoint union of cliquesNP-completenesspolynomial time algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The disjoint cliques problem
• scientific article; zbMATH DE number 89406
• Complexity results on graphs with few cliques
• The maximum clique problem in multiple interval graphs
• The complexity of generalized clique covering

Cited in

(8)

• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• The maximum independent union of cliques problem: complexity and exact approaches
• The maximum vertex coverage problem on bipartite graphs
• scientific article; zbMATH DE number 5914909 (Why is no real title available?)
• Approximation results for the optimum cost chromatic partition problem
• Complexity results on graphs with few cliques
• Assignment-minimum clique coverings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284253)