diff --git a/docs/src/algorithms.md b/docs/src/algorithms.md
index 3ffd096..ad088f9 100644
--- a/docs/src/algorithms.md
+++ b/docs/src/algorithms.md
@@ -65,6 +65,7 @@ GraphsOptim.min_cost_assignment!
 
 ```@docs
 min_vertex_cover
+GraphsOptim.min_vertex_cover!
 ```
 
 Finds a subset $S \subset V$ of vertices of an undirected graph $G = (V,E)$ such that $\forall (u,v) \in E: u \in S \lor v \in S$