ALCOMFT-TR-01-123

Christoph Buchheim and Michael Jünger
Detecting Symmetries by Branch & Cut
Cologne. Work package 4. May 2001.

Abstract: 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.

Postscript file: ALCOMFT-TR-01-123.ps.gz (91 kb).