Adaptive, restart, randomized greedy heuristics for maximum clique
From MaRDI portal
Publication:5960736
DOI10.1023/A:1011925109392zbMath0987.68612MaRDI QIDQ5960736
Laura A. Sanchis, Arun K. Jagota
Publication date: 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A review on algorithms for maximum clique problems, A hybrid heuristic for the maximum clique problem, A study of ACO capabilities for solving the maximum clique problem, Mining relevant information on the Web: a clique-based approach, Simple ingredients leading to very efficient heuristics for the maximum clique problem
