Pages that link to "Item:Q1799389"
From MaRDI portal
The following pages link to A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389):
Displaying 6 items.
- Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- (Q6068263) (← links)