Fast Parallel All-Subgraph Enumeration Using Multicore Machines

Abstract EN

Enumerating all subgraphs of an input graph is an important task for analyzing complex networks.

Valuable information can be extracted about the characteristics of the input graph using all-subgraph enumeration.

Notwithstanding, the number of subgraphs grows exponentially with growth of the input graph or by increasing the size of the subgraphs to be enumerated.

Hence, all-subgraph enumeration is very time consuming when the size of the subgraphs or the input graph is big.

We propose a parallel solution named Subenum which in contrast to available solutions can perform much faster.

Subenum enumerates subgraphs using edges instead of vertices, and this approach leads to a parallel and load-balanced enumeration algorithm that can have efficient execution on current multicore and multiprocessor machines.

Also, Subenum uses a fast heuristic which can effectively accelerate non-isomorphism subgraph enumeration.

Subenum can efficiently use external memory, and unlike other subgraph enumeration methods, it is not associated with the main memory limits of the used machine.

Hence, Subenum can handle large input graphs and subgraph sizes that other solutions cannot handle.

Several experiments are done using real-world input graphs.

Compared to the available solutions, Subenum can enumerate subgraphs several orders of magnitude faster and the experimental results show that the performance of Subenum scales almost linearly by using additional processor cores.