 We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
<clarity>  We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
 We present a new parallel algorithm for k-clique counting /listing that has polylogarithmic span and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .