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 14:55:02 -06:00
parent b5d0686754
commit 782ea18dde
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -36,7 +36,7 @@ Graphs can be directed or undirected.
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 relationships within a social network. It is a fundamental searching for patterns in a graph structure, such as relationships within a social network. It is a fundamental
problem with applications in pattern recognition, databases, security, and biochemistry. problem in graph theory with applications in pattern recognition, databases, security, and biochemistry.
# What is subgraph isomorphism? # What is subgraph isomorphism?