{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:30:08Z","timestamp":1725892208611},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388708"},{"type":"electronic","value":"9783540388722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841883_26","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T11:29:11Z","timestamp":1158665351000},"page":"367-382","source":"Crossref","is-referenced-by-count":7,"title":["Graph Transformation in Constant Time"],"prefix":"10.1007","author":[{"given":"Mike","family":"Dodds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. Journal of the ACM\u00a040(5), 1134\u20131164 (1993)","journal-title":"Journal of the ACM"},{"key":"#cr-split#-26_CR2.1","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Specifying pointer structures by graph reduction. Mathematical Structures in Computer Science (to appear);"},{"key":"#cr-split#-26_CR2.2","unstructured":"Preliminary version available as Technical Report YCS-2003-367, University of York (2003)"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.2000.2958","volume":"167","author":"H.L. Bodlaender","year":"2001","unstructured":"Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Inf. Comput.\u00a0167(2), 86\u2013119 (2001)","journal-title":"Inf. Comput."},{"key":"26_CR4","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings Graph Transformation for Verification and Concurrency","author":"M. Dodds","year":"2005","unstructured":"Dodds, M., Plump, D.: Extending C for checking shape safety. In: Proceedings Graph Transformation for Verification and Concurrency. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (to appear, 2005)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"D\u00f6rr, H. (ed.): Efficient Graph Rewriting and Its Implementation. LNCS, vol.\u00a0922. Springer, Heidelberg (1995)","DOI":"10.1007\/BFb0031909"},{"key":"26_CR6","series-title":"Foundations","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.-J.: Hyperedge replacement graph grammars, ch. 2. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a0I, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"key":"26_CR7","series-title":"Foundations","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/9789812384720_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation.","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J., Rozenberg, G.: Node replacement graph grammars, ch. 2. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol.\u00a0I, pp. 1\u201394. World Scientific, Singapore (1997)"},{"key":"26_CR8","first-page":"27","volume-title":"Proceedings of the 1997 ACM Symposium on Principles of Programming Languages","author":"P. Fradet","year":"1997","unstructured":"Fradet, P., M\u00e9tayer, D.L.: Shape types. In: Proceedings of the 1997 ACM Symposium on Principles of Programming Languages, pp. 27\u201339. ACM Press, New York (1997)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0015447","volume-title":"Algorithms and Computations","author":"J.J. Fu","year":"1995","unstructured":"Fu, J.J.: Linear matching-time algorithm for the directed graph isomorphism problem. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol.\u00a01004, pp. 409\u2013417. Springer, Heidelberg (1995)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","first-page":"64","volume-title":"Combinatorial Pattern Matching","author":"J.J. Fu","year":"1995","unstructured":"Fu, J.J.: Pattern matching in directed graphs. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 64\u201377. Springer, Heidelberg (1995)"},{"key":"26_CR11","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45832-8_12","volume-title":"Graph Transformation","author":"A. Habel","year":"2002","unstructured":"Habel, A., Plump, D.: Relabelling in graph transformation. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 135\u2013147. Springer, Heidelberg (2002)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(87)90051-5","volume":"16","author":"K.-J. Lange","year":"1987","unstructured":"Lange, K.-J., Welzl, E.: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discrete Applied Mathematics\u00a016, 17\u201330 (1987)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841883_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:57Z","timestamp":1605642057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841883_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388708","9783540388722"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11841883_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}