{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:38Z","timestamp":1725551438280},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_11","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"119-130","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures"],"prefix":"10.1007","author":[{"given":"Segla","family":"Kpodjedo","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Galinier","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Antoniol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10515-007-0023-3","volume":"15","author":"M. Abi-Antoun","year":"2008","unstructured":"Abi-Antoun, M., Aldrich, J., Nahas, B., Schmerl, N., Garlan, D.: Differencing and merging of architectural views. Automated Software Engineering\u00a015(1), 35\u201374 (2008)","journal-title":"Automated Software Engineering"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Barecke, T., Detyniecki, M.: Memetic algorithms for inexact graph matching. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 4238\u20134245 (2007)","DOI":"10.1109\/CEC.2007.4425024"},{"key":"11_CR3","unstructured":"Benchmark for AGM, http:\/\/web.soccerlab.polymtl.ca\/~sekpo\/"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. In: Proc. Advances in Pattern Recognition, pp. 1\u201314 (1998)","DOI":"10.1007\/BFb0033223"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-63248-4_10","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"P. Crescenzi","year":"1997","unstructured":"Crescenzi, P., Kann, V.: Approximation on the web: a compendium of np optimization problems. In: Rolim, J.D.P. (ed.) RANDOM 1997. LNCS, vol.\u00a01269, pp. 111\u2013118. Springer, Heidelberg (1997)"},{"key":"11_CR6","unstructured":"Eshera, A.A., Fu, K.S.: A similarity measure between attributed relational graphs for image analysis. In: Proc. 7th Intl Conf. on Pattern Recognition, pp. 75\u201377 (1984)"},{"key":"11_CR7","unstructured":"Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and subgraph isomorphism benchmarking. In: Proc. 3rd IAPR TC-15 Intl Workshop Graph-Based Representations in Pattern Recognition, pp. 176\u2013187 (2001)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part i. ORSA Journal on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Kpodjedo, S., Ricca, F., Galinier, P.: Recovering the evolution stable part using an ecgm algorithm: Is there a tunnel in mozilla? In: European Conf. on Software Maintenance and Reengineering, vol.\u00a00, pp. 179\u2013188 (2009)","DOI":"10.1109\/CSMR.2009.24"},{"issue":"2","key":"11_CR11","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-0000(79)90043-6","volume":"18","author":"G.L. Miller","year":"1979","unstructured":"Miller, G.L.: Graph isomorphism, general remarks. Journal of Computer and System Science\u00a018(2), 128\u2013142 (1979)","journal-title":"Journal of Computer and System Science"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Rascal: calculation of graph simi- larity using maximum common edge subgraphs. Computer Journal\u00a045(6), 631\u2013644 (2002)","journal-title":"Computer Journal"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Toshev, A., Jianbo, S., Daniilidis, K.: Image matching via saliency region correspondences. In: CVPR 2007, IEEE Conf. on Computer Vision and Pattern Recognition, pp. 33\u201340 (2007)","DOI":"10.1109\/CVPR.2007.382973"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Y., Makedon, F., Ford, J., Huang, H.: A bipartite graph matching framework for finding correspondences between structural elements in two proteins. In: Proc. Int. Conf. of the IEEE Engineering in Medecine and Biology Society, pp. 2972\u20132975 (2004)","DOI":"10.1109\/IEMBS.2004.1403843"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-62909-2_85","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"M.L. Williams","year":"1997","unstructured":"Williams, M.L., Wilson, R.C., Hancock, E.R.: Deterministic search strategies for relational graph matching. In: Pelillo, M., Hancock, E.R. (eds.) EMMCVPR 1997. LNCS, vol.\u00a01223, pp. 261\u2013275. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:49:44Z","timestamp":1606186184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}