From 02b553cfe1d4556d6203566c9a82262af80dbe15 Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Wed, 27 May 2020 20:54:00 +0200
Subject: [PATCH] Update progress.md

---
 journal/progress.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/journal/progress.md b/journal/progress.md
index 2f73046..5ad48cf 100644
--- a/journal/progress.md
+++ b/journal/progress.md
@@ -45,6 +45,6 @@
 
 ## literature
 * I wrote 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. 
+    - 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. 
 
-- 
GitLab