{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:30Z","timestamp":1725456030601},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026094","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"28-39","source":"Crossref","is-referenced-by-count":19,"title":["Decomposition trees: Structured graph representation and efficient algorithms"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Lautemann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey. BIT 25 (1985), pp.2\u201323.","journal-title":"BIT"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree. SIAM J.Alg.Disc.Meth. 8 (1987), pp.277\u2013284.","journal-title":"SIAM J.Alg.Disc.Meth."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"S.Arnborg, J.Lagergren, D.Seese, Which problems are easy for tree-decomposable graphs? Draft, November 1987.","DOI":"10.1007\/3-540-19488-6_105"},{"key":"3_CR4","volume-title":"Computers and intractability","author":"M. Garey","year":"1979","unstructured":"M. Garey, D. Johnson, Computers and intractability. Freeman, N.Y., 1979."},{"key":"3_CR5","first-page":"207","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement. LNCS 247 (1987), pp.207\u2013219.","journal-title":"LNCS"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"A.Habel, H.-J.Kreowski, May we introduce to you: Hyperedge replacement. Proc. 3 rd international workshop on graph grammars and their applications to Computer Science, to appear.","DOI":"10.1007\/3-540-18771-5_41"},{"key":"3_CR7","unstructured":"H.-J.Kreowski, Rule trees can help to escape hard graph problems. Preprint, Universit\u00e4t Bremen, 1986."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","volume":"16","author":"K.-J. Lange","year":"1987","unstructured":"K.-J. Lange, E. Welzl, String grammars with disconnection. Discr.Appl.Math. 16 (1987), pp.17\u201330.","journal-title":"Discr.Appl.Math."},{"key":"3_CR9","first-page":"153","volume":"216","author":"T. Lengauer","year":"1986","unstructured":"T. Lengauer, Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. LNCS 216 (1986), pp.153\u2013170.","journal-title":"LNCS"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson, P. Seymour, Graph minors. II. Algorithmic aspects of tree-width. J.Algorithms 7 (1986), pp.309\u2013322.","journal-title":"J.Algorithms"},{"key":"3_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, E. Welzl, Boundary NLC grammars \u2014 basic definitions, normal forms and complexity. Information and Control 69 (1986), pp.136\u2013167.","journal-title":"Information and Control"},{"key":"3_CR12","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.Let. 14 (1982), pp.52\u201356.","journal-title":"Inf.Proc.Let."}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026094.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:50Z","timestamp":1607550950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0026094","relation":{},"subject":[]}}