D3128r4: trim new algorithms list in revision history (#128)

Author: pratzl

D3128_Algorithms/tex/revision.tex

@@ -71,14 +71,8 @@ \subsection*{\paperno r4}
       \item Add time and space complexity to every algorithm section.
       \item New algorithms:
             \begin{itemize}
-                  \item Clustering: Triangle Counting.
-                  \item Communities: Label Propagation (single-graph and two-graph overloads).
-                  \item Components: Articulation Points, BiConnected Components, Connected
-                        Components, Afforest Connected Components, and Kosaraju Strongly
-                        Connected Components.
-                  \item Maximal Independent Set.
-                  \item Link Analysis: Jaccard Coefficient.
-                  \item Minimum Spanning Tree: Kruskal, Inplace Kruskal, and Prim.
+                  \item Afforest Connected Components.
+                  \item Minimum Spanning Tree: Inplace Kruskal.
             \end{itemize}
       \item Replace raw container (range) predecessor and distance parameters with function objects
             (\tcode{PredecessorFn}, \tcode{DistanceFn}) constrained by new \tcode{predecessor_fn_for} and