The following pages link to (Q3002782):
Displaying 4 items.
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
