{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:45:57Z","timestamp":1725453957057},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0000122","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T06:17:45Z","timestamp":1128493065000},"page":"405-414","source":"Crossref","is-referenced-by-count":2,"title":["Characterization of graph classes by forbidden structures and reductions"],"prefix":"10.1007","author":[{"given":"F.","family":"Wankm\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"C.B\u00f6hm, G.Jacopini: \u201cFlow Diagrams, Turing Machines, and Languages With Only Two Formation Rules\u201d Communications of the ACM, Vol. 9, pp. 366\u2013371, 1966","journal-title":"Communications of the ACM"},{"key":"28_CR2","unstructured":"M.R.Garey, D.S.Johnson: \u201cComputers and Intractability \u2014 A Guide to the Theory of NP-Completeness\u201d W.H.Freeman and Company, 1979"},{"issue":"No.2","key":"28_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0019-9958(63)90149-9","volume":"6","author":"S. Greibach","year":"1963","unstructured":"S.Greibach: \u201cThe Undecidability of the Ambiguity Problem for Minimal Linear Grammars\u201d Information & Control, Vol. 6, No. 2, pp. 119\u2013125, 1963","journal-title":"Information & Control"},{"key":"28_CR4","unstructured":"F.Harary: \u201cGraph Theory\u201d Addison-Wesley Publishing Company, 3rd printing, 1972"},{"key":"28_CR5","unstructured":"M.S.Hecht: \u201cFlow Analysis of Computer Programs\u201d North Holland, 1977"},{"key":"28_CR6","unstructured":"K.Kennedy: \u201cA Survey of Data Flow Analysis Techniques\u201d in S.S.Muchnik, N.D.Jones (Ed.): \u201cProgram Flow Analysis\u201d Prentice Hall, 1981"},{"key":"28_CR7","unstructured":"F.Wankm\u00fcller: \u201cCharakterisierung von Graphenklassen durch verbotene Strukturen und Reduktionen\u201d Dissertation, Universit\u00e4t Dortmund, 1982"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000122.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T09:43:25Z","timestamp":1607334205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123105"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0000122","relation":{},"subject":[]}}