Pages that link to "Item:Q2022509"
From MaRDI portal
The following pages link to Polyhedral properties of the induced cluster subgraphs (Q2022509):
Displaying 5 items.
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)