A novel top-k key node query problem in subgraph matching and its greedy strategy

Top-k node selection in graph data is an essential problem in computer science and applications. In view of an important issue in the field of graph data, subgraph matching issue, we define the problem and propose its method for the top-k key node query w.r.t. the subgraph matching. Unlike the general top-k query problem, we aim to find out k nodes that make the matching subgraphs in data graph G that are covered by the k nodes as more as possible. This is a problem of the maximum coverage of subgraph matching, which belongs to the NP-hard problem. We study the problem based on a greedy algorithm and give an intuitive solution. Considering the characteristics of the top-k problem, we propose an improved and more efficient greedy algorithm. Experiments on real social network graph data set (Twitter) show that the related results represent the key nodes that can better reveal the essential characteristics of the query graph in the data graph G. The key node query problem in subgraph matching proposed in this article may have extensive applications in reality, such as the assessment of the influence of specific group members in social network, the detection of abnormal communication in a computer communication network, the road traffic evaluation and load balance problem in a road traffic network, and so on.