Pages that link to "Item:Q1709587"
From MaRDI portal
The following pages link to New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587):
Displaying 5 items.
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- (Q5091196) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)