On Minimal Unique Induced Subgraph Queries

Applied Sciences

Lincheng Jiang¹  Shengze Hu¹  Xiang Zhao¹  Weidong Xiao¹  Bin Ge¹  Haichuan Shang²  Yumei Jing³ 

[1] College of System Engineering, National University of Defense Technology, Changsha 410073, China;National Institute of Information and Communication Technology, Tokyo 184-8795, Japan;School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China;

关键词: graph data;    induced subgraph;    MUIS;    subgraph isomorphism;   

DOI  :  10.3390/app8101798

来源: DOAJ

【 摘 要 】

In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal number of vertices that is unique in G? MUIS query has many potential applications, such as subgraph retrieval, graph visualization, representative subgraph discovery and vertex property exploration. The formal definition of MUIS is given and the properties are discussed in this paper. The baseline and EQA (Efficient Query Answering) algorithms are proposed to solve the MUIS query problem under the filtering-validation framework. In the EQA algorithm, the Breadth First Search (BFS)-based candidate set generation strategy is proposed to ensure the minimality property of MUIS; the matched vertices-based pruning strategy is proposed to prune useless candidate sets and the unnecessary subgraph isomorphism; and the query position-based subgraph isomorphism is proposed to check efficiently the uniqueness of the subgraphs. Experiments are carried on real datasets and synthetic datasets to verify the effectiveness and efficiency of the proposed algorithm under novel measurements. The influencing factors of the process speed are discussed at last in the paper.

【 授权许可】

Unknown