 Our algorithm can be extended to support listing and enumeration, and is based on computing low out-degree orientations . We present a new linear-work and polylogarithmic span algorithm for computing such orientations, and new parallel algorithms for producing unbiased estimations of clique counts  .
<coherence>  Our algorithm can be extended to support listing and enumeration, and is based on computing low out-degree orientations . We present a new linear-work and polylogarithmic span algorithm for computing such orientations, and new parallel algorithms for producing unbiased estimations of clique counts  .
 Our algorithm can be extended to support listing and enumeration, and is based on computing low out-degree orientations , which we present new linear-work and polylogarithmic span algorithm for computing such orientations, and new parallel algorithms for producing unbiased estimations of clique counts .