.png){kind=icon}
.png){kind=icon}
返回
Solving inexact graph isomorphism problems using neural networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2004.01.189.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a neural network approach to solve exact and inexact graph isomorphism problems for weighted graphs. In contrast to other neural heuristics or related methods this approach is based on a neural refinement procedure to reduce the search space followed by an energy-minimizing matching process. Experiments on random weighted graphs in the range of 100-5000 vertices and on chemical molecular structures are presented and discussed. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
graph isomorphism
association graph
maximum clique
Hopfield network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。