{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:00:16Z","timestamp":1725894016817},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382208"},{"type":"electronic","value":"9783642382215"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38221-5_8","type":"book-chapter","created":{"date-parts":[[2013,5,6]],"date-time":"2013-05-06T00:48:12Z","timestamp":1367801292000},"page":"71-80","source":"Crossref","is-referenced-by-count":5,"title":["GMTE: A Tool for Graph Transformation and Exact\/Inexact Graph Matching"],"prefix":"10.1007","author":[{"given":"Mohamed Amine","family":"Hannachi","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Bouassida Rodriguez","sequence":"additional","affiliation":[]},{"given":"Khalil","family":"Drira","sequence":"additional","affiliation":[]},{"given":"Saul Eduardo","family":"Pomares Hernandez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A., Winter, A., Z\u00fcndorf, A.: The PROGRES approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages, and Tools, vol.\u00a03, pp. 487\u2013550. World Scientific (1999)","DOI":"10.1142\/9789812815149_0013"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/3-540-45104-8_41","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G. Taentzer","year":"2000","unstructured":"Taentzer, G.: AGG: A tool environment for algebraic graph transformation. In: M\u00fcnch, M., Nagl, M. (eds.) AGTIVE 1999. LNCS, vol.\u00a01779, pp. 481\u2013488. Springer, Heidelberg (2000)"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"A.H. Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using groove. STTT\u00a014(1), 15\u201340 (2012)","journal-title":"STTT"},{"issue":"2","key":"8_CR4","first-page":"339","volume":"17","author":"L. Lengyel","year":"2005","unstructured":"Lengyel, L., Levendovszky, T., Charaf, H.: Constraint validation support in visual model transformation systems. Acta Cybern.\u00a017(2), 339\u2013357 (2005)","journal-title":"Acta Cybern."},{"key":"8_CR5","unstructured":"Balasubramanian, D., Narayanan, A., van Buskirk, C.P., Karsai, G.: The graph rewriting and transformation language: Great. ECEASST\u00a01 (2006)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45923-5_12","volume-title":"Fundamental Approaches to Software Engineering","author":"J. Lara de","year":"2002","unstructured":"de Lara, J., Vangheluwe, H.: AToM3: A tool for multi-formalism and meta-modelling. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol.\u00a02306, pp. 174\u2013188. Springer, Heidelberg (2002)"},{"key":"8_CR7","unstructured":"Guennoun, K., Drira, K., Diaz, M.: A proved component-oriented approach for managins dynamic software architectures. In: Proc. 7th IASTED International Conference on Software Engineering and Application, Marina Del Rey, CA, USA (2004)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1109\/69.842269","volume":"12","author":"B.T. Messmer","year":"2000","unstructured":"Messmer, B.T., Bunke, H.: Efficient subgraph isomorphism detection: A decomposition approach. IEEE Trans. Knowl. Data Eng.\u00a012(2), 307\u2013323 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0017375","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H. Ehrig","year":"1991","unstructured":"Ehrig, H., Korff, M., L\u00f6we, M.: Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 24\u201337. Springer, Heidelberg (1991)"},{"volume-title":"Handbook of graph grammars and computing by graph transformation: volume I. foundations","year":"1997","key":"8_CR10","unstructured":"Rozenberg, G. (ed.): Handbook of graph grammars and computing by graph transformation: volume I. foundations. World Scientific Publishing Co., Inc., River Edge (1997)"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A. Habel","year":"1995","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae\u00a026, 287\u2013313 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-30203-2_11","volume-title":"Graph Transformations","author":"D. Plump","year":"2004","unstructured":"Plump, D., Steinert, S.: Towards graph programs for graph algorithms. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 128\u2013143. Springer, Heidelberg (2004)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-20844-7_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Fankhauser","year":"2011","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding up graph edit distance computation through fast bipartite matching. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 102\u2013111. Springer, Heidelberg (2011)"},{"issue":"1","key":"8_CR14","first-page":"1","volume":"6","author":"D.R. Wilson","year":"1997","unstructured":"Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. J. Artif. Int. Res.\u00a06(1), 1\u201334 (1997)","journal-title":"J. Artif. Int. Res."},{"issue":"7","key":"8_CR15","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 Vision Comput.\u00a027(7), 950\u2013959 (2009)","journal-title":"Image Vision Comput."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Riesen, K., Neuhaus, M., Bunke, H.: Bipartite Graph Matching for Computing the Edit Distance of Graphs, pp. 1\u201312 (2007)","DOI":"10.1007\/978-3-540-72903-7_1"},{"issue":"1-2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M. Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and codes for dense assignment problems: the state of the art. Discrete Appl. Math.\u00a0100(1-2), 17\u201348 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"8_CR18","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/0305-0548(96)00010-X","volume":"23","author":"A. Volgenant","year":"1996","unstructured":"Volgenant, A.: Linear and semi-assignment problems: A core oriented approach. Computers & OR\u00a023(10), 917\u2013932 (1996)","journal-title":"Computers & OR"},{"key":"8_CR19","unstructured":"Fuss, C., Mosler, C., Ranger, U., Schultchen, E.: The jury is still out: A comparison of agg, fujaba, and progres. ECEASST\u00a06 (2007)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/11841883_27","volume-title":"Graph Transformations","author":"R. Gei\u00df","year":"2006","unstructured":"Gei\u00df, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.: GrGen: A fast SPO-based graph rewriting tool. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 383\u2013397. Springer, Heidelberg (2006)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-45848-4_59","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M.S.: GraphML progress report. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, p. 501. Springer, Heidelberg (2002)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Ben-Halima, R., Jmaiel, M., Drira, K.: A QoS-oriented reconfigurable middleware for self-healing Web services. In: Proceedings of the IEEE International Conference on Web Services (ICWS 2008), Beijing, China. IEEE Computer Society Press (2008)","DOI":"10.1109\/ICWS.2008.113"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38221-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T10:06:44Z","timestamp":1595758004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38221-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382208","9783642382215"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38221-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}