# Detecting Symmetries by Branch & Cut (Extended Abstract)

Buchheim, Christoph and Jünger, Michael
(2002)
*Detecting Symmetries by Branch & Cut (Extended Abstract).*
**Published In:**
Graph drawing : 9th international symposium, GD 2001, Vienna, Austria, September 23 - 26, 2001 ; revised papers, Lecture Notes in Computer Science. 2265 Springer 2002, pp. 496-498.

## 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.

Actions:

Content information:

Deposit Information:

ZAIK Number: | [error in script] |
---|---|

Depositing User: | Christoph Buchheim |

Date Deposited: | 23 Jun 2002 00:00 |

Last Modified: | 08 Jul 2013 08:33 |

URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/422 |