Abstract
In the current chapter we are going to address a new problem in the domain of graph matching. All algorithms for graph distance computation discussed previously in this book consider just a pair of graphs g and G, and derive their distance d(g, G). Our proposed extension consists in computing the distance d(s, S) of a pair of graph sequences s = g1, ..., gn and S = G1, ..., Gm. Both sequences can be of arbitrary length. In particular, the length of s can be different from the length of S. The normal graph distance is obtained as a special case of the proposed graph sequence distance if each s and S consists of only one graph. Similarly to any of the classical graph distance measures d(g, G), the proposed graph sequence distance d(s, S) will be equal to zero if s and S are the same, i.e., n = m and g i = Gi for i = 1, ..., n. On the other hand, d(s, S) will be large for two highly dissimilar sequences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Birkhäuser Boston
About this chapter
Cite this chapter
(2007). Matching Sequences of Graphs. In: A Graph-Theoretic Approach to Enterprise Network Dynamics. Progress in Computer Science and Applied Logic (PCS), vol 24. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4519-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4519-9_8
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4485-7
Online ISBN: 978-0-8176-4519-9
eBook Packages: Computer ScienceComputer Science (R0)