Open armintoepfer opened 7 years ago
What's a heuristic MCE algorithm? An algorithm that is allowed to miss some max cliques? Note that Bernhard implemented the Eppstein-Löffler-Strash algorithm that seems to be implemented in quick cliques. I would prioritize approaches to limit the number of enumerated (quasi)cliques over faster algorithms to enumerate all max cliques. Marcel's thesis might be worthwhile to read for examples where the current approach breaks.
Try out heuristic MCE algos by Eppstein or enumerate quasi-cliques.
Potential drop in replacements: