{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:06Z","timestamp":1725663306544},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:48:58Z","timestamp":1330199338000},"page":"593-609","source":"Crossref","is-referenced-by-count":5,"title":["Boundary NLC and partition controlled graph grammars"],"prefix":"10.1007","author":[{"given":"Emo","family":"Welzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"39_CR1","first-page":"40","volume-title":"Proceedings of the WG 83","author":"F.J. Brandenburg","year":"1983","unstructured":"F.J. Brandenburg, On the complexity of the membership problem for graph grammars, in \"Proceedings of the WG 83\" (M. Nagl and J. Perl, eds.) pp. 40\u201349, Linz: Universitaetsverlag Trauner (1983)."},{"key":"39_CR2","unstructured":"H.Ehrig, D.Janssens, H.-J.Kreowski, and G.Rozenberg, Concurrency of node labelled graph transformations, University of Antwerp, Report 82\u201338 (1982)."},{"key":"39_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness. San Francisco: Freeman (1979)."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E.H. Gurari","year":"1984","unstructured":"E.H. Gurari and I.H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problem, J. Algorithms 5 (1984) 531\u2013546.","journal-title":"J. Algorithms"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, Lecture Notes in Computer Science 247 (1987) 207\u2013219.","journal-title":"Lecture Notes in Computer Science"},{"key":"39_CR6","unstructured":"A.Habel and H.-J. Kreowski, May we introduce to you: edge replacement, Lecture Notes in Computer Science, this volume."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, On the structure of node label controlled graph languages, Inform. Sci. 20 (1980) 191\u2013216.","journal-title":"Inform. Sci."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0255(80)90039-0","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg, Restrictions, extensions and variations of NLC grammars, Inform. Sci 20 (1980) 217\u2013244.","journal-title":"Inform. Sci"},{"key":"39_CR9","unstructured":"G.Lackner and E.Welzl, Coloring graphs in boundary NLC languages, manuscript (1987)."},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","volume":"16","author":"K.-J. Lange","year":"1987","unstructured":"K.-J. Lange and E. Welzl, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Descrete Appl. Math. 16 (1987) 17\u201330.","journal-title":"Descrete Appl. Math."},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg and E. Welzl, Boundary NLC graph grammars \u2014 basic definitions, normal forms, and complexity, Inform. and Control 69 (1986) 136\u2013167.","journal-title":"Inform. and Control"},{"key":"39_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg and E. Welzl, Graph theoretic closure properties of the family of boundary NLC languages, Acta Inform. 23 (1986) 289\u2013309.","journal-title":"Acta Inform."},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(87)90054-0","volume":"16","author":"G. Rozenberg","year":"1987","unstructured":"G. Rozenberg and E. Welzl, Combinatorial properties of boundary NLC graph languages, Discrete Appl. Math. 16 (1987) 59\u201373.","journal-title":"Discrete Appl. Math."},{"key":"39_CR14","unstructured":"R.Schuster, Graphgrammatiken und Grapheinbettung \u2014 Algorithmen und Komplexit\u00e4t, Ph.D. thesis, Universit\u00e4t Passau, West Germany."},{"key":"39_CR15","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","volume":"14","author":"A.O. Slisenko","year":"1982","unstructured":"A.O. Slisenko, Context-free grammars as a tool for describing polynomial-time subclasses of hard problems, Inform. Process. Lett. 14 (1982) 52\u201356.","journal-title":"Inform. Process. Lett."},{"key":"39_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-642-95486-3_38","volume-title":"The Book of L","author":"E. Welzl","year":"1986","unstructured":"E. Welzl, On the set of all subgraphs of the graphs in a boundary NLC graph language, in \"The Book of L (G. Rozenberg and A. Salomaa, eds.), pp. 445\u2013459, Berlin, Heidelberg, New York: Springer (1986)."},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"E.Welzl, Partition controlled graph grammars, manuscript (1987).","DOI":"10.1007\/3-540-18771-5_78"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:37Z","timestamp":1605644137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}