OKlibrary  0.2.1.6
HypergraphColouring.hpp File Reference

Plans for local search algorithms specifically for hypergraph colouring. More...

Go to the source code of this file.


Detailed Description

Plans for local search algorithms specifically for hypergraph colouring.

Todo:
Relations to other modules
Todo:
First prototypes
  • According to the motivation by computing Green-Tao numbers (see Investigations/RamseyTheory/GreenTaoProblems/plans/general.hpp, especially "Faster local search"), we first only consider rnovelty+ and adaptnovelty+.
  • The difference to running a SAT solver is in the more efficient data representation and in, when using the standard translation, not letting the amo- and alo-clauses interfere.
  • In order to be able to compare results with the boolean CNF encoding, we should also implement rnovelty+ and adaptnovelty+ for boolean and for non-boolean clause-sets.

Definition in file HypergraphColouring.hpp.