Research Article
Fast Parallel All-Subgraph Enumeration Using Multicore Machines
Algorithm 1
ESU subgraph enumeration algorithm.
Input: A graph and an integer : | Output: All subgraphs of size | () for each vertex do: | (a) | (b) ExtendSubGraph() | ExtendSubGraph() | () if then output and return | () while do | (a) remove a vertex from | (b) | (c) ExtendSubGraph() |
|