We present a new approach for detecting automorphisms and symmetries of an arbitrary graph based on branch & cut. We derive
an IP-model for this problem and have a first look on cutting planes and primal heuristics. The algorithm was implemented
within the ABACUS framework; its experimental runtimes are promising.
This work was partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).