Pages that link to "Item:Q1183423"
From MaRDI portal
The following pages link to A note on the approximation of the MAX CLIQUE problem (Q1183423):
Displaying 8 items.
- Approximate solution of NP optimization problems (Q672315) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- The maximum clique problem (Q1318271) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
