{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:57Z","timestamp":1750220577838,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Project of Jinan Scientific Research Leaders Laboratory","award":["2018GXRC023"],"award-info":[{"award-number":["2018GXRC023"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019BF026,ZR2019MF013,ZR2017BF031"],"award-info":[{"award-number":["ZR2019BF026,ZR2019MF013,ZR2017BF031"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9,18]]},"DOI":"10.1145\/3422713.3422730","type":"proceedings-article","created":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T04:12:48Z","timestamp":1603512768000},"page":"177-181","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Method for Graph Matching"],"prefix":"10.1145","author":[{"given":"Chunyu","family":"Zhao","sequence":"first","affiliation":[{"name":"Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoning","family":"Yin","sequence":"additional","affiliation":[{"name":"Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoru","family":"Wang","sequence":"additional","affiliation":[{"name":"Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuyang","family":"Zhao","sequence":"additional","affiliation":[{"name":"Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Niu","sequence":"additional","affiliation":[{"name":"Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Riesen K. Jiang X. and Bunke H. 2010. Exact and inexact graph matching: methodology and applications 217--247. DOI= https:\/\/link.springer.com\/chapter\/10.1007%2F978-1-4419-6045-0_7.  Riesen K. Jiang X. and Bunke H. 2010. Exact and inexact graph matching: methodology and applications 217--247. DOI= https:\/\/link.springer.com\/chapter\/10.1007%2F978-1-4419-6045-0_7."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Gold S. Rangarajan A. 1996. A graduated assignment algorithm for graph matching 377--388. DOI= https:\/\/ieeexplore.ieee.org\/document\/491619.  Gold S. Rangarajan A. 1996. A graduated assignment algorithm for graph matching 377--388. DOI= https:\/\/ieeexplore.ieee.org\/document\/491619.","DOI":"10.1109\/34.491619"},{"key":"e_1_3_2_1_3_1","unstructured":"Cho M. Lee J. and Lee K. M. 2010. Reweighted random walks for graph matching 492--505. DOI= https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-15555-0_36.  Cho M. Lee J. and Lee K. M. 2010. Reweighted random walks for graph matching 492--505. DOI= https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-15555-0_36."},{"key":"e_1_3_2_1_4_1","unstructured":"Mills-Tettey G. A. Stentz A. Dias M. B. 2007. The dynamic Hungarian algorithm for the assignment problem with changing costs. Carnegie Mellon University. DOI= http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.69.8170.  Mills-Tettey G. A. Stentz A. Dias M. B. 2007. The dynamic Hungarian algorithm for the assignment problem with changing costs. Carnegie Mellon University. DOI= http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.69.8170."},{"key":"e_1_3_2_1_5_1","unstructured":"Leordeanu M. Hebert M. 2005. A spectral technique for correspondence problems using pair wise constraints 14821489. DOI= https:\/\/ieeexplore.ieee.org\/document\/1544893?arnumber=1544893.  Leordeanu M. Hebert M. 2005. A spectral technique for correspondence problems using pair wise constraints 14821489. DOI= https:\/\/ieeexplore.ieee.org\/document\/1544893?arnumber=1544893."},{"volume-title":"Balanced Graph Matching. Conference on Advances in Neural Information Processing Systems, 313--320","year":"2006","author":"Timoth\u00e9e Cour","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2013.08.024"},{"key":"e_1_3_2_1_8_1","unstructured":"Jiang B Tang J Ding CH Luo B. 2017. Nonnegative orthogonal graph matching. In: Association for the advance of artificial intelligence 4089--4095. DOI= https:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14405.  Jiang B Tang J Ding CH Luo B. 2017. Nonnegative orthogonal graph matching. In: Association for the advance of artificial intelligence 4089--4095. DOI= https:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14405."},{"key":"e_1_3_2_1_9_1","unstructured":"Cour T Shi J. 2007. Solving Markov random fields with spectral relaxation. In: Artificial intelligence and statistics 75--82. DOI= https:\/\/www.researchgate.net\/publication\/220319870_Solving_Markov_Random_Fields_with_Spectral_Relaxation.  Cour T Shi J. 2007. Solving Markov random fields with spectral relaxation. In: Artificial intelligence and statistics 75--82. DOI= https:\/\/www.researchgate.net\/publication\/220319870_Solving_Markov_Random_Fields_with_Spectral_Relaxation."},{"key":"e_1_3_2_1_10_1","unstructured":"Nie W Ding H Liu A Deng Z Su Y. 2018. Subgraph learning for graph matching. Pattern Recognition Letters. DOI=https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167865518302897.  Nie W Ding H Liu A Deng Z Su Y. 2018. Subgraph learning for graph matching. Pattern Recognition Letters. DOI=https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167865518302897."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Wang T Ling H Lang C Feng S. 2017. Graph Matching with Adaptive and Branching Path Following. In: IEEE transactions on pattern analysis and machine intelligence 2853--2867. DOI= https:\/\/ieeexplore.ieee.org\/document\/8089364.  Wang T Ling H Lang C Feng S. 2017. Graph Matching with Adaptive and Branching Path Following. In: IEEE transactions on pattern analysis and machine intelligence 2853--2867. DOI= https:\/\/ieeexplore.ieee.org\/document\/8089364.","DOI":"10.1109\/TPAMI.2017.2767591"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.522"},{"volume-title":"An Integer Projected Fixed Point Method for Graph Matching and MAP Inference. In: Conference on Neural Information Processing Systems, 1114--1122","year":"1966","author":"Leordeanu M.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.522"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.268"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-019-01185-1"}],"event":{"name":"ICBDT 2020: 2020 3rd International Conference on Big Data Technologies","acronym":"ICBDT 2020","location":"Qingdao China"},"container-title":["Proceedings of the 2020 3rd International Conference on Big Data Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422713.3422730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3422713.3422730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:29Z","timestamp":1750195889000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3422713.3422730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,18]]},"references-count":16,"alternative-id":["10.1145\/3422713.3422730","10.1145\/3422713"],"URL":"https:\/\/doi.org\/10.1145\/3422713.3422730","relation":{},"subject":[],"published":{"date-parts":[[2020,9,18]]}}}