{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:12Z","timestamp":1725663372818},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:11Z","timestamp":1330201931000},"page":"11-29","source":"Crossref","is-referenced-by-count":5,"title":["Graph-theoretic properties compatible with graph derivations"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science and Biology, Lect. Not. Comp. Sci. 73, 1979","DOI":"10.1007\/BFb0025713"},{"key":"2_CR2","unstructured":"B.Courcelle: Recognizability and Second Order Definability for Sets of Finite Graphs, Research Report 8634, Bordeaux I University, 1987"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, A. Rosenfeld, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, Lect. Not. Comp. Sci. 291, 1987","DOI":"10.1007\/3-540-18771-5"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, Lect. Not. Comp. Sci. 153, 1983","DOI":"10.1007\/BFb0000094"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume":"153","author":"A. Habel","year":"1983","unstructured":"A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, Lect. Not. Comp. Sci. 153, 143\u2013158, 1983","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","volume":"51","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3\/85, also in: Theor. Comp. Sci. 51, 81\u2013115, 1987","journal-title":"Theor. Comp. Sci."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume":"291","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: May We Introduce to You: Hyperedge Replacement, Lect. Not. Comp. Sci. 291, 15\u201326, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Proc. STACS'87, Lect. Not. Comp. Sci. 247, 207\u2013219, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR9","first-page":"55","volume":"33","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, Techn. Report, short version in: Bull. EATCS 33, 55\u201362, 1987","journal-title":"Bull. EATCS"},{"key":"2_CR10","unstructured":"H.-J. Kreowski: Rule Trees Can Help to Escape Hard Graph Problems, unpublished"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0026094","volume":"299","author":"C. Lautemann","year":"1988","unstructured":"C. Lautemann: Decomposition Trees: Structured Graph Representation and Efficient Algorithms, Proc. CAAP'88, Lect. Not. Comp. Sci. 299, 28\u201339, 1988","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR12","first-page":"201","volume-title":"Efficient Solution of Biconnectivity Problems on Hierarchically Defined Graphs","author":"T. Lengauer","year":"1985","unstructured":"T. Lengauer: Efficient Solution of Biconnectivity Problems on Hierarchically Defined Graphs, Proc. WG'85, Trauner Verlag, Linz, 201\u2013215, 1985"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-19488-6_129","volume":"317","author":"T. Lengauer","year":"1988","unstructured":"T. Lengauer, E. Wanke: Efficient Analysis of Graph Properties on Context-Free Graph Languages, Proc. ICALP'88, Lect. Not. Comp. Sci. 317, 379\u2013393, 1988","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR14","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, E. Welzl: Boundary NLC Graph Grammars \u2014 Basic Definitions, Normal Forms, and Complexity, Inf. Contr. 69, 136\u2013167, 1986","journal-title":"Inf. Contr."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages, Acta Informatica 23, 289\u2013309, 1986","journal-title":"Acta Informatica"},{"key":"2_CR16","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 Graph Grammars as a Tool for Describing Polynomial-time Subclasses of Hard Problems, Inf. Proc. Lett. 14, 52\u201356, 1982","journal-title":"Inf. Proc. Lett."}],"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-50728-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:44Z","timestamp":1605647924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}