Detecting symmetries by branch & cut

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2265 LNCS, Issue , 2002, Pages 178-188

  Buchheim, Christoph ^a   Jünger, Michael ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DRAWING (GRAPHICS); GRAPHIC METHODS;

ARBITRARY GRAPHS; AUTOMORPHISMS; CUTTING PLANES; FIRST LOOK; IP MODELS; NEW APPROACHES; RUNTIMES; BRANCH AND CUT;

DRAWING (GRAPHICS); INTEGER PROGRAMMING;

EID: 84867447793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_15     Document Type: Conference Paper

References (9)

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.
2. P. Eades and X. Lin. Spring algorithms and symmetry. Theoretical Computer Science, 240(2):379-405, 2000.
3. H. de Fraysseix. An heuristic for graph symmetry detection. In J. Kratochvíl, editor, Graph Drawing '99, volume 1731 of Lecture Notes in Computer Science, pages 276-285. Springer-Verlag, 1999.
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.
5. M. Jünger and S. Thienel. The ABACUS system for branch-and-cut-and- pricealgorithms in integer programming and combinatorial optimization. Software - Practice & Experience, 30(11):1325-1352, 2000.
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.
7. H. Purchase. Which aesthetic has the greatest effect on human understanding? In Giuseppe Di Battista, editor, Graph Drawing '97, volume 1353 of Lecture Notes in Computer Science, pages 248-261. Springer-Verlag, 1997.
8. R. C. Read and D. G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1:339-363, 1977.
9. The Rome library of undirected graphs. Available at: www.inf.uniroma3.it/ people/gdb/wp12/undirected-1.tar.gz.