diff --git a/journal/todo.md b/journal/todo.md
index 57499ea9c3c1399555cfeb9673a9fad292d9ddf3..9dbf47f4bf6fbe86fe5b2956c4e5bf8f9bb73ab5 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -47,8 +47,11 @@
     - Refinde the concept how to test and which test results you want to include. 
     
 ## literature 
-* Read _Imposing Connectivity Constraints in Forest Planning Models_.
+* Read _Imposing Connectivity Constraints in Forest Planning Models_. ✔
     - Check for different constraints which could strengthen the formulation. (with focus on symmetry breaking)
+        - They did not mention a symmetry breaker *but* they mentioned some other types of inequalities which could strengthen the formulation according to the connectivity specification. 
+        - A thing which was interesting that for their specific problems (which were not really close to MCDS and had only connectivity in common) they achived a much stronger LP bound. 
+        - They added cuts before an ILP solution was found and added cuts for LP solutions also. 
 * Read _An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer_ again with focus on symmetry breaking.
 * Read through _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets*_ again and check for symmetry breaking or other constraints to tighten up the space of solutions.