{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:09:20Z","timestamp":1742915360973,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031230271"},{"type":"electronic","value":"9783031230288"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23028-8_24","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"233-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Similarity Using Tree Edit Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7810-0859","authenticated-orcid":false,"given":"Shri Prakash","family":"Dwivedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2064-5805","authenticated-orcid":false,"given":"Vishal","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1547-7974","authenticated-orcid":false,"given":"Umesh","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"24_CR1","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data. Advances in Database Systems, Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1, 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0033223","volume-title":"Advances in Pattern Recognition","author":"H Bunke","year":"1998","unstructured":"Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds.) SSPR\/SPR 1998. LNCS, vol. 1451, pp. 1\u201314. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0033223"},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"24_CR5","unstructured":"Dwivedi, S.P.: Some algorithms on exact, approximate and error-tolerant graph matching. Ph.D. thesis, Indian Institute of Technology (BHU), Varanasi. arXiv:2012.15279 (2019)"},{"key":"24_CR6","unstructured":"Dwivedi, S.P.: Inexact graph matching using centrality measures. arXiv:2201.04563 (2021)"},{"key":"24_CR7","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-981-16-8546-0_34","volume-title":"International Conference on Artificial Intelligence and Sustainable Engineering","author":"SP Dwivedi","year":"2022","unstructured":"Dwivedi, S.P.: Approximate bipartite graph matching by modifying cost matrix. In: Sanyal, G., Travieso-Gonz\u00e1lez, C.M., Awasthi, S., Pinto, C.M.A., Purushothama, B.R. (eds.) International Conference on Artificial Intelligence and Sustainable Engineering. LNEE, vol. 837, pp. 415\u2013422. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-8546-0_34"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant graph matching using homeomorphism. In: International Conference on Advances in Computing, Communication and Informatics (ICACCI), pp. 1762\u20131766 (2017)","DOI":"10.1109\/ICACCI.2017.8126099"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.patrec.2018.09.014","volume":"116","author":"SP Dwivedi","year":"2018","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant graph matching using node contraction. Pattern Recogn. Lett. 116, 58\u201364 (2018)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-97785-0_32","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"SP Dwivedi","year":"2018","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant geometric graph similarity. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 337\u2013344. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97785-0_32"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.patrec.2019.06.025","volume":"125","author":"SP Dwivedi","year":"2019","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant geometric graph similarity and matching. Pattern Recogn. Lett. 125, 625\u2013631 (2019)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.patrec.2020.03.019","volume":"133","author":"SP Dwivedi","year":"2020","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant approximate graph matching utilizing node centrality information. Pattern Recogn. Lett. 133, 313\u2013319 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.patrec.2015.07.010","volume":"65","author":"M Ferrer","year":"2015","unstructured":"Ferrer, M., Serratosa, F., Riesen, K.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recogn. Lett. 65, 29\u201336 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recogn. Artif. Intell. 28, 1450001.1-1450001.40 (2014)","DOI":"10.1142\/S0218001414500013"},{"key":"24_CR15","first-page":"1087","volume":"22","author":"KS Fu","year":"1973","unstructured":"Fu, K.S., Bhargava, B.K.: Tree systems for syntactic pattern recognition. IEEE Trans. Comput. 22, 1087\u20131099 (1973)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybern. 4, 100\u2013107 (1968)","journal-title":"IEEE Trans. Sys. Sci. Cybern."},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR\/SPR 2006. LNCS, vol. 4109, pp. 163\u2013172. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11815921_17"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-27868-9_18","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M Neuhaus","year":"2004","unstructured":"Neuhaus, M., Bunke, H.: An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR\/SPR 2004. LNCS, vol. 3138, pp. 180\u2013189. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27868-9_18"},{"key":"24_CR19","doi-asserted-by":"publisher","DOI":"10.1142\/6523","volume-title":"Bridging the Gap Between Graph Edit Distance and Kernel Machines","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific, Singapore (2007)"},{"key":"24_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks-An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks-An Introduction. Oxford University Press, Oxford (2010)"},{"key":"24_CR21","series-title":"Advances in Computer Vision and Pattern Recognition","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-27252-8_9","volume-title":"Structural Pattern Recognition with Graph Edit Distance","author":"K Riesen","year":"2015","unstructured":"Riesen, K.: Appendix B: data sets. In: Riesen, K., et al. (eds.) Structural Pattern Recognition with Graph Edit Distance. ACVPR, pp. 149\u2013156. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27252-8_9"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR\/SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89689-0_33"},{"issue":"4","key":"24_CR23","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(4), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"4","key":"24_CR24","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2014.11.002","volume":"48","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Bunke, H.: Improving bipartite graph edit distance approximation using various search strategies. Pattern Recogn. 48(4), 1349\u20131363 (2015)","journal-title":"Pattern Recogn."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Riesen, K., Fischer, A., Bunke, H. (2015) Estimating graph edit distance using lower and upper bounds of bipartite approximations. Int. J. Pattern Recogn. Artif. Intell. 29(2), 1550011 (2015)","DOI":"10.1142\/S0218001415500111"},{"issue":"3","key":"24_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"24_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013363 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Sole-Ribalta, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recogn. Artif. Intell. 26(5), 1260004.1-1260004.21 (2012)","DOI":"10.1142\/S021800141260004X"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"WH Tsai","year":"1979","unstructured":"Tsai, W.H., Fu, K.S.: Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. 9, 757\u2013768 (1979)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"24_CR30","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. PVLDB 2, 25\u201336 (2009)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23028-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:59:15Z","timestamp":1672541955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23028-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031230271","9783031230288"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23028-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sspr2022.encs.concordia.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}