The following pages link to The clique-partitioning problem (Q807637):
Displaying 11 items.
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Clique partitions, graph compression and speeding-up algorithms (Q1900930) (← links)
- Coherent network partitions (Q2026346) (← links)
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs (Q2093879) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- Metric space method for constructing splitting partitions of graphs (Q2178736) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- Balancing stability and efficiency in team formation as a generalized roommate problem (Q6078610) (← links)
