![Fast Best-Effort Pattern Matching in Large Attributed Graphs thumbnail](https://apiminio.videolectures.net/vln/lectures/2951/1/en/thumbnail.jpg?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=masoud%2F20241217%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20241217T002009Z&X-Amz-Expires=604800&X-Amz-SignedHeaders=host&X-Amz-Signature=560877307e861ad6452840b5995b1a7722aaffce4f092a7327112a8e1d98c938)
Fast Best-Effort Pattern Matching in Large Attributed Graphs
Published on Aug 14, 20076964 Views
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person’s job title. In such a setting, we want to find subgraphs that match a user