A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Subgraph pattern matching is a basic building block for many applications. Where to commence the pattern matching task and how to proceed are fundamental issues in massive graphs. In this paper, we propose the most impact vertices in view of a query graph and diffusion walk on data graph. We present a novel impact vertices-aware diffusion walk algorithm, a distributed algorithm named DiffWalk, for subgraph pattern matching. Our algorithm employs the most impact vertices from a query graph todoi:10.1109/access.2019.2908930 fatcat:coetakrz5zeylgzgiyp3jkvc44