From 782ea18ddee678926446886a981213565d47a5e3 Mon Sep 17 00:00:00 2001 From: Owen Troke-Billard Date: Tue, 17 Sep 2024 14:55:02 -0600 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index af025dd..556ef2c 100644 --- a/README.md +++ b/README.md @@ -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 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?