 Finally, we design  new parallel work-efficient algorithms for approximating the k-clique densest subgraph . Our first algorithm gives a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts;
<clarity>  Finally, we design  new parallel work-efficient algorithms for approximating the k-clique densest subgraph . Our first algorithm gives a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts;
 Finally, we design new parallel work-efficient algorithms for approximating the k-clique densest subgraph , the first of which is a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts;