diff --git a/journal/progress.md b/journal/progress.md
index 5ad48cf06d04dd1012147ee3b4697ee65719631d..8dc3e45788dd133d6ea925424cf0e29e6ab02368 100644
--- a/journal/progress.md
+++ b/journal/progress.md
@@ -44,7 +44,7 @@
 * I wrote a paragraph which introduces ILP
 
 ## literature
-* I wrote following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
+* I read following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
     - This paper references several other papers which deal with the topic. So I've also read the following _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets_. But they also used the vertex-separator constraints and a lazy approach. 
     - Their results quite good. So I guess it also makes sense to make some research how the graphs they used "looked like" and what characteristics they had that our graphs not have.