Hardness and methods to solve CLIQUE

DOI10.1007/BF02948987zbMath1003.68027OpenAlexW1796509207MaRDI QIDQ5959359

Shaohan Ma, Daming Zhu, Junfeng Luan

Publication date: 17 October 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948987

zbMATH Keywords

CLIQUE

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Uses Software

• HEWN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of approximating the independent set problem
• Optimization, approximation, and complexity classes
• HEWN: A polynomial algorithm for CLIQUE problem
• On the hardness of approximating minimization problems
• The complexity of theorem-proving procedures