.png){kind=icon}
返回
Graph distances using graph union
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-8655(01)00022-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An existing graph distance metric based on maximum common subgraph has been extended by a proposal to define the problem size with the union of the two graphs being measured, rather than the larger of the two graphs used in the existing metric. For some applications the graph distance measure is more appropriate if the graph union approach is used. This graph distance measure is shown to be a metric. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
subgraph isomorphism
graph distance
maximum common subgraph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic nodule
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏
分享收藏
查看更多内容