Detecting Symmetries by Branch & Cut

Buchheim, Christoph and Jünger, Michael (2002) Detecting Symmetries by Branch & Cut. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 178-188(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_15).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_15
Classifications: G Algorithms and Complexity > G.910 Symmetries
P Styles > P.780 Symmetric
URI: http://gdea.informatik.uni-koeln.de/id/eprint/491

Actions (login required)

View Item View Item