Detecting Symmetries by Branch & Cut
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.
KeywordsInteger Linear Program Maximum Clique Valid Inequality Node Label Arbitrary Graph
- 1.O. Bastert. New ideas for canonically computing graph algebras. Technical Report TUM-M9803, Technische Universität München, Fakultät für Mathematik, 1998.Google Scholar
- 4.S.-H. Hong, P. Eades, and S.-H. Lee. Finding planar geometric automorphisms in planar graphs. In K.-Y. Chwa et al., editors, Algorithms and computation. 9th international symposium, ISAAC’ 98, volume 1533 of Lecture Notes in Computer Science, pages 277–286. Springer-Verlag, 1998.CrossRefGoogle Scholar
- 6.J. Manning. Computational complexity of geometric symmetry detection in graphs. In Great Lakes Computer Science Conference, volume 507 of Lecture Notes in Computer Science, pages 1–7. Springer-Verlag, 1990.Google Scholar