Matching Hierarchical Graphs
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.
KeywordsSingle Node Edit Distance Original Graph Graph Similarity Abnormal Event
Unable to display preview. Download preview PDF.