Pages that link to "Item:Q2174276"
From MaRDI portal
The following pages link to The maximum independent union of cliques problem: complexity and exact approaches (Q2174276):
Displaying 6 items.
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- On independent cliques and linear complementarity problems (Q2095085) (← links)
- Maximizing dominance in the plane and its applications (Q5925538) (← links)
- Asymptotic bounds for clustering problems in random graphs (Q6196888) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)
