The clique-partitioning problem
From MaRDI portal
Publication:807637
DOI10.1016/0898-1221(91)90001-KzbMATH Open0731.05028OpenAlexW2076193235MaRDI QIDQ807637FDOQ807637
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
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Reducibility among Combinatorial Problems
- Minimal clique partitions and pairwise balanced designs
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- Title not available (Why is that?)
- Clique Covering of Graphs IV. Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clique coverings of graphs V: maximal-clique partitions
- A practical approach to the chromatic partition problem
Cited In (10)
- Title not available (Why is that?)
- Coherent network partitions: characterizations with cographs and prime graphs
- Coherent network partitions
- Balancing stability and efficiency in team formation as a generalized roommate problem
- Concise integer linear programming formulation for clique partitioning problems
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Clique partitions, graph compression and speeding-up algorithms
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- The disjoint cliques problem
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs
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)
