A note on the approximation of the MAX CLIQUE problem
From MaRDI portal
Publication:1183423
DOI10.1016/S0020-0190(05)80002-XzbMath0751.68027MaRDI QIDQ1183423
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Extended and discretized formulations for the maximum clique problem ⋮ Finding optimal subgraphs by local search ⋮ On the complexity of the shortest-path broadcast problem ⋮ Approximate solution of NP optimization problems ⋮ A note on the descriptive complexity of maximization problems ⋮ Maximum cut-clique problem: ILS heuristics and a data analysis application ⋮ The maximum clique problem ⋮ Modelling competitive Hopfield networks for the maximum clique problem
Cites Work