.png){kind=icon}
返回
Error-tolerant graph matching in linear computational cost using an initial small partial matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2018.04.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Error-tolerant graph matching has been demonstrated to be an NP-problem, therefore, its exact computation has an exponential computational cost and several sub-optimal algorithms have been presented with the aim of making the runtime acceptable in some applications. Some well-known sub-optimal algorithms have sixth, cubic or quadratic computational costs with respect to the order of the graphs. Although these computational costs could be considered very low, when applications deal with large graphs (for instance in social networks), the quadratic cost continues to be unacceptable. For this reason, we present an error-tolerant graph-matching algorithm that has a O(d(3.5) .) computational cost, d being the number of output edges per node and n the order of the graphs. Note that, usually, in social networks, it holds that d << n and for this reason we consider the cost to be linear, in other words O(k .), k being a low constant. Our method needs an initial seed, which is composed of one or several node-to-node mappings. The algorithm has been applied to analyse the evolution of social networks. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Graph Edit Distance
Sub-optimal algorithm
Linear computational cost
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏Computation of graph edit distance: Reasoning about optimality and speed-up图编辑距离的计算: 关于最优性和加速的推理
PREAI
分享收藏
查看更多内容