{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:58Z","timestamp":1725455578106},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024506","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"303-317","source":"Crossref","is-referenced-by-count":0,"title":["The bounded tree-width problem of context-free graph languages"],"prefix":"10.1007","author":[{"given":"R.","family":"Skodinis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, D. Seese. Easy problems for tree-decomposable graphs. J. of Algorithms, 12:308\u2013340, 1991.","journal-title":"J. of Algorithms"},{"key":"25_CR2","first-page":"105","volume":"317","author":"S. Arnborg","year":"1989","unstructured":"S. Arnborg, A. Proskurowski. Linear time algorithms on graphs with bounded tree-width. LNCS, 317:105\u2013119, 1989.","journal-title":"LNCS"},{"key":"25_CR3","first-page":"99","volume":"291","author":"F.J. Brandenburg","year":"1987","unstructured":"F.J. Brandenburg. On partially ordered graph grammars. LNCS, 291: 99\u2013111, 1987.","journal-title":"LNCS"},{"key":"25_CR4","first-page":"312","volume":"488","author":"F.J. Brandenburg","year":"1991","unstructured":"F.J. Brandenburg. The equivalence of boundary and confluent graph grammars on graph languages of bounded degree. LNCS, 488:312\u2013322, 1991.","journal-title":"LNCS"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In SIAM J. Computing, 25:1305\u20131317, 1996.","journal-title":"SIAM J. Computing"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoret. Compact. Sci., 55:141\u2013181, 1987.","journal-title":"Theoret. Compact. Sci."},{"key":"25_CR7","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. Inform. and Comput., 85:12\u201375, 1990.","journal-title":"Inform. and Comput."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/inco.1995.1020","volume":"116","author":"B. Courcelle","year":"1995","unstructured":"B. Courcelle Structural properties of context-free sets of graphs generated by vertex replacement. Inform. and Comput., 116:275\u2013293, 1995.","journal-title":"Inform. and Comput."},{"key":"25_CR9","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. J. Comput. System Sci., 46:218\u2013270, 1993.","journal-title":"J. Comput. System Sci."},{"key":"25_CR10","first-page":"148","volume":"380","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet. Context-free NCE graph grammars. LNCS, 380:148\u2013161, 1989.","journal-title":"LNCS"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet and L. M. Heyker. The string generating power of context-free hypergraph graph grammars. J. Comput. System Sci., 43:328\u2013360, 1991.","journal-title":"J. Comput. System Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0022-0000(05)80022-4","volume":"48","author":"J. Engelfriet","year":"1994","unstructured":"J. Engelfriet and L. M. Heyker. Hypergraph languages of bounded degree. J. Comput. System Sci., 48:58\u201389, 1994.","journal-title":"J. Comput. System Sci."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0890-5401(89)90030-8","volume":"81","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet and G. Leih. Linear graph grammars: Power and complexity. Inform. and Comput., 81:88\u2013121, 1989.","journal-title":"Inform. and Comput."},{"key":"25_CR14","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. J. Comput. System Sci., 40:307\u2013345, 1990.","journal-title":"J. Comput. System Sci."},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","volume":"84","author":"J. Engelfriet","year":"1990","unstructured":"J. Engelfriet, G. Rozenberg. A comparison of boundary graph grammars and context-free hypergraph grammars. Inform. and Comput., 84:163\u2013206, 1990.","journal-title":"Inform. and Comput."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.J. Kreowski, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '90, Vol. 532 of LNCS. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0017372"},{"key":"25_CR17","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, Vol. 291 of LNCS. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18771-5"},{"key":"25_CR18","unstructured":"A. Habel. Hyperedge Replacement: Grammars and Languages, Vol. 643 of LNCS, Springer-Verlag, 1992."},{"key":"25_CR19","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. Inform. Sci., 20:191\u2013216, 1980.","journal-title":"Inform. Sci."},{"key":"25_CR20","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. Inform. Sci., 20:217\u2013244, 1980.","journal-title":"Inform. Sci."},{"key":"25_CR21","volume-title":"Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graphgrammatiken","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":"25_CR22","doi-asserted-by":"crossref","unstructured":"T. Kloks. Treewidth. Computations and Approximations. Vol. 842 of LNCS, Springer-Verlag, 1994.","DOI":"10.1007\/BFb0045375"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02241984","volume":"16","author":"M. Nagl","year":"1976","unstructured":"M. Nagl. Formal languages of labelled graphs. Computing 16:113\u2013137, 1976.","journal-title":"Computing"},{"key":"25_CR24","first-page":"70","volume":"73","author":"M. Nagl","year":"1980","unstructured":"M. Nagl. A tutorial and bibliographical survey of graph grammars. LNCS, 73:70\u2013126, 1980.","journal-title":"LNCS"},{"key":"25_CR25","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1006\/jcss.1995.1083","volume":"51","author":"K. Skodinis","year":"1995","unstructured":"K. Skodinis and E. Wanke. Emptiness problems of eNCE graph languages. J. Comput. System Sci., 51:472\u2013485, 1995.","journal-title":"J. Comput. System Sci."},{"key":"25_CR26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1006\/inco.1997.2628","volume":"135","author":"K. Skodinis","year":"1997","unstructured":"K. Skodinis and E. Wanke. The Bounded Degree Problem for eNCE Graph Grammars. Inform. and Comput., 135:15\u201335, 1997.","journal-title":"Inform. and Comput."}],"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\/BFb0024506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:30Z","timestamp":1586568930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0024506","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}