{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:45:31Z","timestamp":1725518731259},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_4","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T10:48:17Z","timestamp":1221648497000},"page":"39-53","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Mazanek","sequence":"first","affiliation":[]},{"given":"Sonja","family":"Maier","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Minas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol.\u00a0I, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"issue":"5","key":"4_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C. Lautemann","year":"1989","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Inf.\u00a027(5), 399\u2013421 (1989)","journal-title":"Acta Inf."},{"key":"4_CR3","unstructured":"Kasami, T.: An efficient recognition and syntax analysis algorithm for context free languages. Scientific Report AF CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Massachussetts (1965)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0167-6423(02)00037-0","volume":"44","author":"M. Minas","year":"2002","unstructured":"Minas, M.: Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming\u00a044(2), 157\u2013180 (2002)","journal-title":"Science of Computer Programming"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-540-70590-1_18","volume-title":"RTA 2008","author":"S. Mazanek","year":"2008","unstructured":"Mazanek, S., Minas, M.: Functional-logic graph parser combinators. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 261\u2013275. Springer, Heidelberg (2008)"},{"key":"4_CR6","unstructured":"Minas, M.: Spezifikation und Generierung graphischer Diagrammeditoren. Shaker-Verlag, Aachen (2001) zugl. Habilitationsschrift Universit\u00e4t Erlangen-N\u00fcrnberg (2000)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-44745-8_30","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"E. Bengoetxea","year":"2001","unstructured":"Bengoetxea, E., Pedro Larra, n., Bloch, I., Perchant, A.: Estimation of distribution algorithms: A new evolutionary computation approach for graph matching problems. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol.\u00a02134, pp. 454\u2013468. Springer, Heidelberg (2001)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-17218-1_47","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Kaul","year":"1987","unstructured":"Kaul, M.: Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol.\u00a0246, pp. 29\u201340. Springer, Heidelberg (1987)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-45868-9_10","volume-title":"Graphics Recognition. Algorithms and Applications","author":"G. S\u00e1nchez","year":"2002","unstructured":"S\u00e1nchez, G., Llad\u00f3s, J., Tombre, K.: An error-correction graph grammar to recognize texture symbols. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol.\u00a02390, pp. 128\u2013138. Springer, Heidelberg (2002)"},{"issue":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.jvlc.2005.06.001","volume":"16","author":"G. Costagliola","year":"2005","unstructured":"Costagliola, G., Deufemia, V., Polese, G., Risi, M.: Building syntax-aware editors for visual languages. Journal of Visual Languages and Computing\u00a016(6), 508\u2013540 (2005)","journal-title":"Journal of Visual Languages and Computing"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","first-page":"174","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":"4_CR12","unstructured":"Sen, S., Baudry, B., Vangheluwe, H.: Domain-specific model editors with model completion. In: Multi-paradigm Modelling Workshop at MoDELS 2007 (2007)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Taentzer, G., Crema, A., Schmutzler, R., Ermel, C.: Generating domain-specific model editors with complex editing commands. In: Proc. Third Intl. Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007) (2007)","DOI":"10.1007\/978-3-540-89020-1_8"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:37:38Z","timestamp":1606185458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}