Project: Algorithms for finding special substructures in combinatorial objects
- project duration
- 01-OCT-02 – 15-APR-07
- We study search and generation algorithms for substructures with special properties for combinatorial objects, appearing in graph theory and finite geometry. Given the inherent symmetry of the problem (automoprhisms, equivalences, unique labeling) we try to develop specific search techniques and pruning heuristics to appely in comination with standard backtracking techniques.