Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation
Authors:
- Haoyan XuHXHaoyan Xu
- Ziheng DuanZDZiheng Duan
- Yueyang WangYWYueyang Wang
- Jie FengJFJie Feng
- Runjian ChenRCRunjian Chen
- Qianru ZhangQZQianru Zhang
- Zhongbin XuZXZhongbin Xu
- 1 June 2021
- journal article
- research article
- Published by Elsevier in Neurocomputing
- Vol. 439, 348-362
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62072065)
- National Natural Science Foundation of China (62002035)
- National Natural Science Foundation of China (61902004)
- Natural Science Foundation of Chongqing Municipality
- Fundamental Research Funds for the Central Universities (2019CDQYRJ006)
- Fundamental Research Funds for the Central Universities (NO.2020CDJQY-A022)
- Chongqing Research Program of Basic Research and Frontier Technology (cstc2019jcyj-msxmX0589)
- Science and Technology Innovation 2025 Major Project of Ningbo Municipality (2018B10047)
- National Key Research and Development Program of China (2019YFB1706101)
- National Key Research and Development Program of China (2019YFB2102600)
This publication has 22 references indexed in Scilit:
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- Fuzzy lattice reasoning (FLR) type neural computation for weighted graph partitioningNeurocomputing, 2009
- SAGA: a subgraph matching tool for biological graphsBioinformatics, 2006
- Edit distance-based kernel functions for structural pattern classificationPattern Recognition, 2006
- Measuring preferential attachment in evolving networksEurophysics Letters, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Matching hierarchical structures using association graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999
- Multilayer perceptron, fuzzy sets, and classificationIEEE Transactions on Neural Networks, 1992
- Stereo correspondence through feature grouping and maximal cliquesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955