edited research

Author: hmukesh5

src/App.tsx

@@ -210,7 +210,7 @@ function App() {
             content: <>
                 Currently, I'm doing research at Texas A&M in {lagraphlink}, which is a library of user-friendly graph algorithms built on top of {suitesparselink}, which is an implementation of {graphblaslink}, which is a standard that defines a set of sparse matrix operations.
                 Go ahead and re-read that.
-                These matrix operations, when performed on adjacency matrices, is a parallel approach to computing graph algorithms.
+                These matrix operations, when performed on adjacency matrices, can be a parallel approach to computing graph algorithms.
                 I am developing an algorithm in LAGraph for graph coloring, where a graph is colored such that no 2 nodes share the same color.
                 This research is being developed through the {urslink} (2024-2025 cohort), and a paper and a presentation will be available in Spring 2025.
             </>