diff --git a/README.md b/README.md
index d5df197..ac99a70 100644
--- a/README.md
+++ b/README.md
@@ -1,15 +1,7 @@
 # Reachability algorithms by Roditty and Zwick
-The goal of this project is to implement a collection of dynamic reachability
-algorithms covered in "Improved Dynamic Reachability Algorithms for Directed Graphs"
+The goal of this repository is to implement a collection of decremental/dynamic reachability
+algorithms, inspired by "Improved Dynamic Reachability Algorithms for Directed Graphs"
 by Liam Roditty and Uri Zwick.
-In more detail, the algorithms implemented, include a decremental reachability
-algorithm for the transitive closure of a directed acyclic graph, a decremental
-reachability algorithm for the transitive closure of a general directed graph, a
-dynamic reachability algorithm of a directed acyclic graph and a dynami reachability
-algorithm of a general directed graph.
-The core algorithm of Roditty and Zwick is a decremental reachability algorithm for
-the strongly connected components of the general directed graph, on which all
-reachability algorithms for general directed graphs are based.
 
 ## A code example
 ```cpp
@@ -51,8 +43,5 @@ git clone --recurse-submodules https://github.com/stefiosif/dynamic-reachability
 cd dynamic-reachability-algorithms
 ```
 
-# Benchmark
-
-
 ## References
 * [Improved Dynamic Reachability Algorithms for Directed Graphs](https://ieeexplore.ieee.org/document/1181993)