The clique-partitioning problem

DOI10.1016/0898-1221(91)90001-KMaRDI QIDQ807637zbMATHOpenAlexFDO

Authors Tariq Samad, Jayaram Bhasker

Publication date 1991

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(91)90001-k

zbMATH Keywords

clique-partitioning a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 7192822
• Clique partitions, graph compression and speeding-up algorithms
• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• On the partition and coloring of a graph by cliques
• Approximation Algorithms for Some Graph Partitioning Problems

Cites work

• scientific article; zbMATH DE number 3839870 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• A graph coloring algorithm for large scheduling problems
• A practical approach to the chromatic partition problem
• Clique Covering of Graphs IV. Algorithms
• Clique coverings of graphs V: maximal-clique partitions
• Minimal clique partitions and pairwise balanced designs
• New methods to color the vertices of a graph
• Reducibility among combinatorial problems

Cited in

(14)

• Grouping products for the optimization of production processes: a case in the steel manufacturing industry
• Decomposing clique search problems into smaller instances based on node and edge colorings
• Clique partitions, graph compression and speeding-up algorithms
• Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs
• Balancing stability and efficiency in team formation as a generalized roommate problem
• Coherent network partitions
• scientific article; zbMATH DE number 1472140 (Why is no real title available?)
• Concise integer linear programming formulation for clique partitioning problems
• Clique partitioning with value-monotone submodular cost
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
• Coherent network partitions: characterizations with cographs and prime graphs
• Splitting Edge Partitions of Graphs
• Metric space method for constructing splitting partitions of graphs
• The disjoint cliques problem

This page was built for publication: The clique-partitioning problem

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