Centrality Speeds the Subgraph Isomorphism Search Up in Target Aware Contexts

摘要

The subgraph isomorphism (SubGI) problem is known to be a NP-Complete problem. Several methodologies use heuristic approaches to solve it, differing into the strategy to search the occurrences of a graph into another. This choice strongly influences their computational effort requirement. We investigate seven search strategies where global and local topological properties of the graphs are exploited by means of weighted graph centrality measures. Results on benchmarks of biological networks show the competitiveness of the proposed seven alternatives and that, among them, local strategies predominate on sparse target graphs, and closeness- and eigenvector-based strategies outperform on dense graphs.