Parallel Network Organization Algorithm for Graph Matching and Subgraph Isomorphism Detection

摘要

Data representations using graphs are very flexible and are used in a wide variety of field. The development of algo- rithms to perform basic processing at high speeds is vital for detecting subgraphs with important meaning from a graph set and for searching for subgraphs which match a given graph. However, as the number of graphs in question increase , the Computation costs required for processing rise dramatically. In This paper, the authors describe an algorithm which detects Isomorphisms which have several graphs in common from Among a set of labeled directed graphs and then organizes from Into a network based on the detected isomorphisms.