An Improved Algorithm for Matching Large Graphs
An Improved Algorithm for Matching Large Graphs
复制标题
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
L. Cordella;P. Foggia;Carlo Sansone;M. Vento
中科院分区：
文献类型：
--
作者：
L. Cordella;P. Foggia;Carlo Sansone;M. Vento
本文提出了一种改进的图匹配算法，该算法能够有效地解决属性关系图上的图同构和图-子图同构问题。这个版本特别适合于处理非常大的图，因为它的内存需求比同类的其他算法要小得多。算法的详细描述后，实验比较对以前的版本（由相同的作者开发）和Ullmann的算法。
In this paper an improved version of a graph matching algorithm is presented, which is able to efficiently solve the graph isomorphism and graph-subgraph isomorphism problems on Attributed Relational Graphs. This version is particularly suited to work with very large graphs, since its memory requirements are quite smaller than those of other algorithms of the same kind. After a detailed description of the algorithm, an experimental comparison is made against both the previous version (developed by the same authors) and the Ullmann’s algorithm.