{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:31:34Z","timestamp":1725568294349},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672036"},{"type":"electronic","value":"9783540464648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46464-8_4","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T13:43:10Z","timestamp":1287582190000},"page":"45-58","source":"Crossref","is-referenced-by-count":1,"title":["Neighborhood-Preserving Node Replacements"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Skodinis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-18771-5_48","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"F.-J. Brandenburg","year":"1987","unstructured":"Brandenburg, F.-J.: On partially ordered graph grammars. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol.\u00a0291, pp. 99\u2013111. Springer, Heidelberg (1987)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/3-540-53904-2_106","volume-title":"Rewriting Techniques and Applications","author":"F.-J. Brandenburg","year":"1991","unstructured":"Brandenburg, F.-J.: The equivalence of boundary and confluent graph grammars on graph languages of bounded degree. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 312\u2013322. Springer, Berlin (1991)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of Graph Grammars and their Application to Computer Science","year":"1979","unstructured":"Claus, V., Ehrig, H., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a073. Springer, Berlin (1979)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci.\u00a046, 218\u2013270 (1993)","journal-title":"J. Comput. System Sci."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of Graph Grammars and their Application to Computer Science","year":"1994","unstructured":"Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a01073. Springer, Berlin (1994)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of Graph Grammars and their Application to Computer Science","year":"1991","unstructured":"Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a0532. Springer, Berlin (1991)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of Graph Grammars and their Application to Computer Science","year":"1987","unstructured":"Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a0291. Springer, Berlin (1987)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of Graph Grammars and their Application to Computer Science","year":"1983","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a0153. Springer, Berlin (1983)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","volume":"40","author":"J. Engelfriet","year":"1990","unstructured":"Engelfriet, J., Leih, G., Welzl, E.: Boundary graph grammars with dynamic edge relabeling. J. Comput. System Sci.\u00a040, 307\u2013345 (1990)","journal-title":"J. Comput. System Sci."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","volume":"84","author":"J. Engelfriet","year":"1990","unstructured":"Engelfriet, J., Rozenberg, G.: A comparison of boundary graph grammars and context-free hypergraph grammars. Inform. Comput.\u00a084, 163\u2013206 (1990)","journal-title":"Inform. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/9789812384720_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, ch. 1, vol.\u00a01, pp. 1\u201394. World Scientific Publishing Co. Pte. Ltd., Singapore (1997)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A. Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol.\u00a0643. Springer, Berlin (1992)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Himsolt, M.: Graphed: An interactive tool for developing graph grammars. In: Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol.\u00a0532, pp. 61\u201365 (1991)","DOI":"10.1007\/BFb0017378"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: Restrictions, extensions, and variations of NLC grammars. Inform. Sci.\u00a020, 217\u2013244 (1980)","journal-title":"Inform. Sci."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","volume":"22","author":"D. Janssens","year":"1981","unstructured":"Janssens, D., Rozenberg, G.: Decision problems for node label controlled graph grammars. J. Comput. System Sci.\u00a022, 144\u2013177 (1981)","journal-title":"J. Comput. System Sci."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0020-0190(91)90113-V","volume":"39","author":"J. Jeffs","year":"1991","unstructured":"Jeffs, J.: Order independent NCE grammars recognized in polynomial time. Inform. Process. Lett.\u00a039, 161\u2013164 (1991)","journal-title":"Inform. Process. Lett."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C. Lautemann","year":"1990","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informat.\u00a027, 399\u2013421 (1990)","journal-title":"Acta Informat."},{"key":"4_CR18","first-page":"136","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC graph grammars - basic definitions, normal forms and complexity. Inform. Comput.\u00a069, 136\u2013167 (1986)","journal-title":"Inform. Comput."},{"key":"4_CR19","unstructured":"Skodinis, K., Wanke, E.: Neighborhood-preserving confluent node replacement. Manuscript (1995)"},{"key":"4_CR20","unstructured":"Proceedings of IEEE Symposium on Visual Languages. IEEE, Isle of Capri, Italy (1997)"}],"container-title":["Lecture Notes in Computer Science","Theory and Application of Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46464-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T16:48:08Z","timestamp":1559753288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46464-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672036","9783540464648"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46464-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}