Fast Parallel All-Subgraph Enumeration Using Multicore Machines

Algorithm 2

ESE enumeration algorithm.

Input: A graph , and an integer : , and an edge

Output: All subgraphs of size that contain

 () let  Stack be a stack of tuples

 () if    then  swap   and            //to guarantee that v is smaller than w

 ()

 () push new tuple() into Stack

 () while  Stack is not empty do:

  (a) pop the tuple on top of the stack

  (b) if    then output   and return //top0] is the first item of the tuple

  (c) while    do:            //top1] is the extension set

   (i) remove a vertex from

   (ii)  //top2] is the root

   (iii) push new tuple() into Stack