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 15:25:10 -06:00
parent 575fff5468
commit 7044757161
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

@ -38,7 +38,7 @@ Subgraph matching is the task of finding instances of a query graph within a lar
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 in graph theory 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 a subgraph isomorphism?
A graph is a structure consisting of a set of objects where some pairs of objects are connected. A graph isomorphism is A graph is a structure consisting of a set of objects where some pairs of objects are connected. A graph isomorphism is
a one-to-one correspondence between two graphs such that objects connected in one are also connected in the other. a one-to-one correspondence between two graphs such that objects connected in one are also connected in the other.