Parallel Subgraph Isomorphism

The subgraph isomorphism problem deals with determining whether a given graph H is isomorphic to some subgraph of another graph G. In this paper we attempt to parallelize a fast serial subgraph isomorphism library, VFLib, which uses backtracking search to find a solution. Our parallel solution runs on Cilk++ for efficient execution on multicore machines. In our work we examine the benefits and drawbacks of several data structures when used during this backtracking search. We also examine several heuristics for spawning threads. Finally, we use conditional copying to achieve near-linear speedup with the number of CPU cores on random graphs and reasonable performance on parasitic inputs.