Abstract
While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques.
We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bauderon M., Carrère F., Orthogonal decomposition of graphs, GRATRA 2000, Joint APPLIGRAPH and GETGRATS Workshop, Technische Universität Berlin, 2000, 2, pp 197–204
Bauderon M., Jacquet H., Categorical product as a generic graph rewriting mechanism, Journ. Applied Categorical Structures, 2001, Volume 9, Issue 1, January 2001, pp. 65–82
Cournier A., Habib M., A new linear algorithm for modular decomposition, Lect. Notes in Comp. Sci. 787, 1994, 68–84
Ehrenfeucht A., Harju T., Rozenberg G., The theory of 2-structures. A framework for decomposition and transformation of graphs. World Scientific Publishing, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauderon, M., Carrère, F. (2002). Decomposing Graphs with Symmetries. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-45832-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44310-0
Online ISBN: 978-3-540-45832-6
eBook Packages: Springer Book Archive