{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:44:28Z","timestamp":1743072268926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182230"},{"type":"electronic","value":"9783319182247"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18224-7_10","type":"book-chapter","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T16:48:35Z","timestamp":1430758115000},"page":"98-107","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting Volgenant-Jonker for Approximating Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"William","family":"Jones","sequence":"first","affiliation":[]},{"given":"Aziem","family":"Chawdhary","sequence":"additional","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1145\/115234.115349","volume":"38","author":"E. Balasn","year":"1991","unstructured":"Balasn, E., Miller, D., Pekny, J., Toth, P.: A parallel shortest augmenting path algorithm for the assignment problem. JACM\u00a038(4), 985\u20131004 (1991)","journal-title":"JACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bourquin, M., King, A., Robbins, E.: BinSlayer: Accurate Comparison of Binary Executables. In: Proceedings of Program Protection and Reverse Engineering Workshop. ACM (2013)","DOI":"10.1145\/2430553.2430557"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Cela, E.: Linear Assignment Problems and Extensions. Springer (1999)","DOI":"10.1007\/978-1-4757-3023-4_2"},{"issue":"3","key":"10_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. International Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X. Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A Survey of Graph Edit Distance. Pattern Analysis and Applications\u00a013(1), 113\u2013129 (2010)","journal-title":"Pattern Analysis and Applications"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing\u00a038(4), 325\u2013340 (1987)","journal-title":"Computing"},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Myers, R., Wison, R.C., Hancock, E.R.: Bayesian graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(6), 628\u2013635 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"10_CR8","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 and Vision Computing\u00a027(7), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F. Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recognition Letters\u00a045, 244\u2013250 (2014)","journal-title":"Pattern Recognition Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Serratosa, F., Cort\u00e9s, X.: Edit Distance Computed by Fast Bipartite Graph Matching, pp. 253\u2013262 (2014)","DOI":"10.1007\/978-3-662-44415-3_26"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","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. VLDB Endowment\u00a02(1), 25\u201336 (2009)","journal-title":"VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18224-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T16:49:04Z","timestamp":1675270144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18224-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182230","9783319182247"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18224-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}