Fast Parallel All-Subgraph Enumeration Using Multicore Machines

Algorithm 3

PSE subgraph enumeration algorithm.

Input: A graph , an integer : as the size of subgraphs, and an integer as the number of concurrent threads

Output: All subgraphs of size

 () let   be an empty list.

 () for each edge   do:

  (a) if   is not in   then insert into

 () spawn threads

 () for  each thread do in parallel:

  (a) while   is not empty do:

   (i) pick an edge from

   (ii) enumerate all subgraphs of size containing using ESE algorithm

 () wait until all threads are done