Abstract
The concept of graph isomorphism lies (explicitly or implicitly) behind almost any discussion of graphs, to the extent that it can be regarded as the fundamental concept of graph theory. In particular, the automorphism group of a graph provides much information about symmetries in the graph. The related problems of subgraph isomorphism and maximum common subgraph isomorphism generalize pattern matching in strings and trees to graphs, and find application whenever structures described by graphs need to be compared.
A straightforward enumerative algorithm might require 40 years of running time on a very high speed computer in order to compare two 15-node graphs.
—Stephen H. Unger [332]
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valiente, G. (2002). Graph Isomorphism. In: Algorithms on Trees and Graphs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04921-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-04921-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07809-5
Online ISBN: 978-3-662-04921-1
eBook Packages: Springer Book Archive