Abstract
The problem of exact symmetry detection in general graphs has received much attention recently. In spite of its NP-hardness, two different algorithms have been presented that in general can solve this problem quickly in practice [5,2]. However, as most graphs do not admit any exact symmetry at all, the much harder problem of fuzzy symmetry detection arises: a minimal number of certain modifications of the graph should be allowed in order to make it symmetric. We present a general approach to this problem: we allow arbitrary edge deletions and edge creations; every single modification can be given an individual weight. We apply integer programming techniques to solve this problem exactly or heuristically and give runtime results for a first implementation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
ABACUS – A Branch-And-CUt System, http://www.informatik.uni-koeln.de/abacus
Abelson, D., Hong, S., Taylor, D.: A group-theoretic method for drawing graphs symmetrically. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 86–97. Springer, Heidelberg (2002)
Buchheim, C.: An Integer Programming Approach to Exact and Fuzzy Symmetry Detection. PhD thesis, Institut für Informatik, Universität zu Köln (2003), Available at kups.ub.uni-koeln.de/volltexte/2003/918
Buchheim, C., Jünger, M.: Detecting symmetries by branch & cut. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 178–188. Springer, Heidelberg (2002)
Buchheim, C., Jünger, M.: Detecting symmetries by branch&cut. Mathematical Programming, Series B 98, 369–384 (2003)
Chen, H.-L., Lu, H.-I., Yen, H.-C.: On maximum symmetric subgraphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 372–383. Springer, Heidelberg (2001)
CPLEX 7.0, http://www.ilog.com/products/cplex
Eades, P., Lin, X.: Spring algorithms and symmetry. Theoretical Computer Science 240(2), 379–405 (2000)
Hong, S., Eades, P.: Drawing planar graphs symmetrically II: Biconnected graphs. Technical Report CS-IVG-2001-01, University of Sydney (2001)
Hong, S., Eades, P.: Drawing planar graphs symmetrically III: Oneconnected graphs. Technical Report CS-IVG-2001-02, University of Sydney (2001)
Hong, S., Eades, P.: Drawing planar graphs symmetrically IV: Disconnected graphs. Technical Report CS-IVG-2001-03, University of Sydney (2001)
Hong, S., McKay, B., Eades, P.: Symmetric drawings of triconnected planar graphs. In: SODA 2002, pp. 356–365 (2002)
Manning, J.: Computational complexity of geometric symmetry detection in graphs. In: Sherwani, N.A., Kapenga, J.A., de Doncker, E. (eds.) Great Lakes CS Conference 1989. LNCS, vol. 507, pp. 1–7. Springer, Heidelberg (1991)
Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchheim, C., Jünger, M. (2004). An Integer Programming Approach to Fuzzy Symmetry Detection. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive