.png){kind=icon}
返回
Matching graphs by pivoting
.png){kind=icon}
OA
AI
DOI：10.1016/S0167-8655(02)00256-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by a recent (continuous) quadratic formulation, in this paper we present a pivoting-based heuristic for graph matching based on the corresponding linear complementarity problem. Experiments are presented which demonstrate the potential of the proposed method. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
graph matching
linear complementarity problem
maximum clique
maximum common subgraph
quadratic programming
pivoting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
Intravenous Sodium Bicarbonate Verifies Intravenous Position of Catheters in Ventilated PatientsOAAI
OAAI分享收藏Optimal matching between the suspension and the rubber bushing of the in-wheel motor system.png)
Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering
Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile EngineeringIF0
PREAI
分享收藏
查看更多内容