{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T08:35:57Z","timestamp":1791189357159,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540232070","type":"print"},{"value":"9783540302032","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30203-2_11","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T18:59:27Z","timestamp":1285095567000},"page":"128-143","source":"Crossref","is-referenced-by-count":22,"title":["Towards Graph Programs for Graph Algorithms"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandra","family":"Steinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press and McGraw-Hill (2000)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation \u2014 Part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, ch. 3, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30203-2_13","volume-title":"Graph Transformations","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 161\u2013177. Springer, Heidelberg (2004)"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1142\/9789812815149_0014","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"C. Ermel","year":"1999","unstructured":"Ermel, C., Rudolf, M., Taentzer, G.: The AGG approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, ch. 14, pp. 551\u2013603. World Scientific, Singapore (1999)"},{"issue":"3\/4","key":"11_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A. Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae\u00a026(3\/4), 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"11_CR6","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011(5), 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR7","unstructured":"Habel, A., Plump, D.: A minimal and complete programming language for graph transformation (in preparation)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 230\u2013245. Springer, Heidelberg (2001)"},{"key":"11_CR9","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":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45832-8_14","volume-title":"Graph Transformation","author":"R. Heckel","year":"2002","unstructured":"Heckel, R., K\u00fcster, J., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 161\u2013176. Springer, Heidelberg (2002)"},{"key":"11_CR11","volume-title":"Graphs, Networks and Algorithms","author":"D. Jungnickel","year":"2002","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (2002)"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1142\/9789812815149_0015","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"H.-J. Kreowski","year":"1999","unstructured":"Kreowski, H.-J., Kuske, S.: Graph transformation units and modules. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, ch. 15, pp. 607\u2013638. World Scientific, Singapore (1999)"},{"key":"11_CR13","first-page":"185","volume-title":"Term Graph Rewriting: Theory and Practice","author":"M. L\u00f6we","year":"1993","unstructured":"L\u00f6we, M., Korff, M., Wagner, A.: An algebraic framework for the transformation of attributed graphs. In: Sleep, R., Plasmeijer, R., van Eekelen, M. (eds.) Term Graph Rewriting: Theory and Practice, pp. 185\u2013199. John Wiley, Chichester (1993)"},{"key":"11_CR14","unstructured":"Schied, G.: Uber Graphgrammatiken, eine Spezifikationsmethode f\u00fcr Programmiersprachen und Verteilte Regelsysteme. Doctoral dissertation, Universit\u00e4t Erlangen- N\u00fcrnberg, Volume 25(2) of Arbeitsberichte des Instituts f\u00fcr Informatik (1992) (in German)"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1142\/9789812815149_0013","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Sch\u00fcrr","year":"1999","unstructured":"Sch\u00fcrr, A., Winter, A., Z\u00fcndorf, A.: The PROGRES approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, ch. 13, pp. 487\u2013550. World Scientific, Singapore (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30203-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:43Z","timestamp":1620014083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30203-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232070","9783540302032"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30203-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}