updated research section

Author: hmukesh5

src/App.tsx

@@ -205,13 +205,13 @@ function App() {
     const research = [
         {
             value: "graphblas",
-            title: <>graphBLAS</>,
-            link: <></>,
+            title: <>LAGraph algorithms | </>,
+            link: <a href="http://github.com/hmukesh5/LAGraph-coloring/" target="_blank" className={`underline ${darkmodeSwitcher}`}>github</a>,
             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 a C 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, 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.
+                These matrix operations, when performed on adjacency matrices, is 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), to see if there are any performance gains over other coloring algorithms.
                 This research is being done through the {urslink} (2024-2025 cohort), and a paper and presentation will be available in spring 2025.
                 <div className="h-2" />
                 <span className="italic">{lagraphlink} | {suitesparselink}</span>