The following pages link to The disjoint cliques problem (Q4345417):
Displaying 7 items.
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes (Q3627689) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Maximizing dominance in the plane and its applications (Q5925538) (← links)
