{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:51Z","timestamp":1725664251861},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590712"},{"type":"electronic","value":"9783540491835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59071-4_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:02:01Z","timestamp":1330275721000},"page":"180-192","source":"Crossref","is-referenced-by-count":0,"title":["Exponential time analysis of confluent and boundary eNCE graph languages"],"prefix":"10.1007","author":[{"given":"K.","family":"Skodinis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Wanke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"F.J. Brandenburg. On partially ordered graph grammars. In [7], volume 291 of LNCS, pages 99\u2013111, 1987.","DOI":"10.1007\/3-540-18771-5_48"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28:114\u2013133, 1981.","journal-title":"Journal of the ACM"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '78, volume 73 of LNCS. Springer-Verlag, 1979.","DOI":"10.1007\/BFb0025713"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, 1990.","journal-title":"Information and Computation"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218\u2013270, 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.J. Kreowski, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '90, volume 532 of LNCS. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0017372"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '86, volume 291 of LNCS. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18771-5"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '82, volume 153 of LNCS. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0000094"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90002-3","volume":"40","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet, G. Leih, and E. Welzl. Boundary graph grammars with dynamic edge relabeling. Journal of Computer and System Sciences, 40:307\u2013345, 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR10","unstructured":"A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992."},{"key":"15_CR11","doi-asserted-by":"crossref","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. Information Science, 20:191\u2013216, 1980.","journal-title":"Information Science"},{"key":"15_CR12","doi-asserted-by":"crossref","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. Information Science, 20:217\u2013244, 1980.","journal-title":"Information Science"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","volume":"21","author":"D. Janssens","year":"1982","unstructured":"D. Janssens and G. Rozenberg. Graph grammars with neighbourhood-controlled embedding. Theoretical Computer Science, 21:55\u201374, 1982.","journal-title":"Theoretical Computer Science"},{"key":"15_CR14","volume-title":"Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graphgrammatiken. Dissertation","author":"M. Kaul","year":"1985","unstructured":"M. Kaul. Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graphgrammatiken. Dissertation, Universit\u00e4t Osnabr\u00fcck, Osnabr\u00fcck, Germany, 1985."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"M. Kaul. Practical applications of precedence graph grammars. In [7], volume 291 of LNCS, pages 326\u2013342, 1987.","DOI":"10.1007\/3-540-18771-5_62"},{"issue":"2","key":"15_CR16","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1145\/151261.151268","volume":"40","author":"T. Lengauer","year":"1993","unstructured":"T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. Journal of the ACM, 40(2):368\u2013393, 1993.","journal-title":"Journal of the ACM"},{"issue":"1","key":"15_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(91)90035-Z","volume":"94","author":"E. Wanke","year":"1991","unstructured":"E. Wanke. Algorithms for graph problems on BNLC structured graphs. Information and Computation, 94(1):93\u2013122, 1991.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59071-4_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:30Z","timestamp":1605648330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59071-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590712","9783540491835"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-59071-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}