Approximate Bipartite Graph Matching by Modifying Cost Matrix

扫码查看

原文链接

NETL

外文摘要：Graph matching is the process of evaluating the structural similarity between the two graphs。 Bipartite graph matching is one of the important technique for error-tolerant graph matching。 In this paper， we present an approach to bipartite graph matching by considering the edge assignment instead of node assignment during the creation of cost matrix。 We demonstrate this technique can achieve better accuracy on some graph dataset。

外文关键词：

Graph matchingBipartite graph matchingGraph edit distance

作者：

Shri Prakash Dwivedi

展开 >

作者单位：

Department of Information Technology, G.B. Pant University of Agriculture and Technology, Pantnagar, India

会议名称：

International conference on artificial intelligence and sustainable engineering

会议母体文献：

International conference on artificial intelligence and sustainable engineering : select proceedings of AISE 2020

页码：

415-422

出版时间：

2020

DOI：

10.1007/978-981-16-8546-0_34