berkus
/
vf2
mirror of https://github.com/OwenTrokeBillard/vf2.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update README.md

This commit is contained in:
Owen Troke-Billard 2024-09-17 22:32:17 -06:00
parent ab2652a67c
commit b99f279d85
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
README.md
View File

@ -35,13 +35,12 @@ Graphs can be directed or undirected.
# Motivation # Motivation
Subgraph matching is the task of finding instances of a query graph within a larger data graph. It is useful when Subgraph matching is the task of finding instances of a query graph within a larger data graph. It is useful when
searching for patterns in a graph structure, such as searching a graph database. It is a fundamental searching for patterns in a graph structure, such as relationships in a social network. It is a fundamental problem in
problem in graph theory with applications in pattern recognition, databases, security, and biochemistry. graph theory with applications in pattern recognition, databases, security, and biochemistry.
An illustrative example is finding relationships in social networks. Consider a network like LinkedIn where each node is Consider a network like LinkedIn where each node is a person, and each edge represents a connection. You are tasked with
a person, and each edge represents a connection. You are tasked with finding cases where five software developers and a finding cases where five software developers and a doctor all know each other. You can make a query graph with
doctor all know each other. You can make a query graph with developers and a doctor, and search for instances of that developers and a doctor, and search for instances of that query in the larger network.
query in the larger network.
# What is a subgraph isomorphism? # What is a subgraph isomorphism?