.png){kind=icon}
返回
Hypergraph isomorphism using association hypergraphs
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2019.09.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (maximal) clique in the association hypergraph, that corresponds to the maximum (maximal) isomorphism between the hypergraphs to be matched. The proposed approach has extensively been tested with experiments on a large synthetic dataset, including hypergraphs of different cardinalities, order and connectivities. In particular the isomorphism version of the problem has been analyzed. The results obtained are impressive in terms of correctness, thus showing that, despite its simplicity, the Baum-Eagon dynamics has an outstanding capacity of finding globally optimal solutions and solving the hypergraph isomorphism problem. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Hypergraph isomorphism
Sub-hypergraph isomorphism
Association graph
Baum-Eagon inequality
Polynomial optimization
Complexity classes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
Modular DNA-origami-based nanoarrays enhanced cell binding-affinity through “lock-key” interaction.png)
OAAI
IF0
OAAI分享收藏
查看更多内容