"Detecting Symmetries by Branch & Cut (Extended Abstract)"
Article by Christoph Buchheim, Michael Jünger, available as BibTeX Source.
Zentrum für Angewandte Informatik Köln, Lehrstuhl Jünger
Preprint Key:	zaik2001-422
Keywords:	graph drawing, integer programming, symmetries
MSC codes:	05C85, 20B25, 68R10, 90C35
This article was published in January 2002 by Springer in the proceedings "Graph Drawing '01" (edited by P. Mutzel, M. Jünger, S. Leipert), series "Lecture Notes in Computer Science", volume 2265, pages 178-188.
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.