 Finally, we design  new parallel work-efficient algorithms for approximating the k-clique densest subgraph .
<meaning-changed>  Finally, we design  new parallel work-efficient algorithms for approximating the k-clique densest subgraph .
 Finally, we design two new parallel work-efficient algorithms for approximating the k-clique densest subgraph .