From c7c3c4bae015110c6acec71becb0feabf45f4a38 Mon Sep 17 00:00:00 2001
From: "Dynex [DNX]" <113523376+dynexcoin@users.noreply.github.com>
Date: Sat, 8 Jun 2024 10:07:44 +0200
Subject: [PATCH] Update README.MD

---
 maxcut/README.MD | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/maxcut/README.MD b/maxcut/README.MD
index 24d5b59..b3c5970 100644
--- a/maxcut/README.MD
+++ b/maxcut/README.MD
@@ -1,6 +1,6 @@
 # Update: Dynex finds best-known MaxCut for the Stanford G70 benchmark
 
-The cut size [9,553](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/maxcut_best_9553.pkl) for [G70](https://web.stanford.edu/~yyye/yyye/Gset/) found by Dynex is the best-known MaxCut than previous reported results on June 8th 2024. The previous record of 9,541 was found using a special purpose algorithm designed for MaxCut ([Breakout Local Search for the Max-Cut problem](https://www.researchgate.net/publication/257392755_Breakout_Local_Search_for_the_Max-Cutproblem)) in 2013. It is worth noting that an increase of one better cut involves an exponentially increasing complexity. 
+The cut size [9,553](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/maxcut_best_9553.pkl) for [G70](https://web.stanford.edu/~yyye/yyye/Gset/) found by [Dynex](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/G70_dynex.ipynb) is the best-known MaxCut than previous reported results on June 8th 2024. The previous record of 9,541 was found using a special purpose algorithm designed for MaxCut ([Breakout Local Search for the Max-Cut problem](https://www.researchgate.net/publication/257392755_Breakout_Local_Search_for_the_Max-Cutproblem)) in 2013. It is worth noting that an increase of one better cut involves an exponentially increasing complexity. 
 
 ## Validating the MaxCut solution of 9,553