子图同构问题
诱导子图同构问题
图同构
计算机科学
匹配(统计)
理论计算机科学
随机图
同构(结晶学)
时间复杂性
无差别图
路宽
弦图
图形
算法
数学
折线图
晶体结构
化学
统计
电压图
结晶学
作者
Vincenzo Carletti,Pasquale Foggia,Alessia Saggese,Mario Vento
标识
DOI:10.1109/tpami.2017.2696940
摘要
Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others. Except for special classes of graphs, graph matching has in the worst-case an exponential complexity; however, there are algorithms that show an acceptable execution time, as long as the graphs are not too large and not too dense. In this paper we introduce a novel subgraph isomorphism algorithm, VF3, particularly efficient in the challenging case of graphs with thousands of nodes and a high edge density. Its performance, both in terms of time and memory, has been assessed on a large dataset of 12,700 random graphs with a size up to 10,000 nodes, made publicly available. VF3 has been compared with four other state-of-the-art algorithms, and the huge experimentation required more than two years of processing time. The results confirm that VF3 definitely outperforms the other algorithms when the graphs become huge and dense, but also has a very good performance on smaller or sparser graphs.
科研通智能强力驱动
Strongly Powered by AbleSci AI