Abstract
In general, the computation of graph similarity is a very costly task. In the context of this book, however, we focus on a special class of graphs that allow for low-order polynomial-time matching algorithms. The considered class of graphs is characterized by the constraint that each node has a unique node label. This constraint is met in all computer network monitoring and abnormal event detection applications considered in this book.
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.
Rights and permissions
Copyright information
© 2007 Birkhäuser Boston
About this chapter
Cite this chapter
(2007). Matching Hierarchical 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_12
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4519-9_12
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)