Towards graph programs for graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3256, Issue , 2004, Pages 128-143

  Plump, Detlef ^a   Steinert, Sandra ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; COMPUTATIONAL LINGUISTICS; SEMANTICS;

ATTRIBUTED GRAPH TRANSFORMATIONS; COMPUTING FUNCTIONS; CONDITIONAL RULES; GUIDING PRINCIPLES; LANGUAGE EXTENSIONS; NUMERICAL COMPUTATIONS; RULE APPLICATION; SHORTEST PATH ALGORITHMS;

GRAPH THEORY;

EID: 34248557712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30203-2_11     Document Type: Article

References (15)

1. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press and McGraw-Hill, 2000.
2. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation -Part I: Basic concepts and double pushout approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 3, pages 163-245. World Scientific, 1997.
3. H. Ehrig, U. Prange, and G. Taentzer. Fundamental theory for typed attributed graph transformation. In Proc. International Conference on Graph Transformation (ICGT 2004), Lecture Notes in Computer Science. Springer-Verlag, 2004. This volume.
4. C. Ermel, M. Rudolf, and G. Taentzer. The AGG approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 14, pages 551-603. World Scientific, 1999.
5. A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26(3/4):287-313, 1996.
6. A. Habel, J. Müller, and D. Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
7. A. Habel and D. Plump. A minimal and complete programming language for graph transformation. In preparation.
8. A. Habel and D. Plump. Computational completeness of programming languages based on graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS '01), volume 2030 of Lecture Notes in Computer Science, pages 230-245. Springer-Verlag, 2001.
9. A. Habel and D. Plump. Relabelling in graph transformation. In Proc. International Conference on Graph Transformation (ICGT 2002), volume 2505 of Lecture Notes in Computer Science, pages 135-147. Springer-Verlag, 2002.
10. R. Heckel, J. Küster, and G. Taentzer. Confluence of typed attributed graph transformation systems. In Proc. International Conference on Graph Transformation (ICGT 02), volume 2505 of Lecture Notes in Computer Science, pages 161-176. Springer-Verlag, 2002.
11. D. Jungnickel. Graphs, Networks and Algorithms. Springer-Verlag, 2002.
12. H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 15, pages 607-638. World Scientific, 1999.
13. M. Löwe, M. Korff, and A. Wagner. An algebraic framework for the transformation of attributed graphs. In R. Sleep, R. Plasmeijer, and M. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, pages 185-199. John Wiley, 1993.
14. G. Schied. Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und Verteilte Regelsysteme. Doctoral dissertation, Universität Erlangen-Nürnberg, 1992. Volume 25(2) of Arbeitsberichte des Instituts für Informatik (in German).
15. A. Schürr, A. Winter, and A. Zündorf. The PROGRES approach: Language and environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 13, pages 487-550. World Scientific, 1999.