Graph pattern matching in progres

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

Volumn 1073, Issue , 1996, Pages 454-468

  Ztindorf, Albert ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; DIRECTED GRAPHS; FORMAL LANGUAGES; GRAPHIC METHODS; HIGH LEVEL LANGUAGES; PATTERN MATCHING; SPECIFICATIONS;

APPLICATION AREA; COMPLEX STRUCTURED DATUM; GRAPH PATTERN MATCHING; GRAPH REWRITING RULES; GRAPH REWRITING SYSTEMS; GRAPH-BASED ALGORITHMS; LABELED GRAPHS; MULTI-PARADIGM LANGUAGES;

GRAPH THEORY;

EID: 84947768684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. Beyer M.: GAG: Ein graphischer Editor für algebraische Graphgrammatiksysteme; Masters Thesis, TU Berlin (1991)
2. Bunke H, Glauser T, Tran T. -H.: An efficient implementation of graph grammars based on the RETE matching algorithm; in [EhKrRo 91], 174-189 (1991)
3. Dörr H.: Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time; technical report, Report B-94-08, Freie Universitat Berlin (1994)
4. Ehrig H, Kreowski H. -J, Rozenberg G. (Eds.): Proc. 4th Int. Workshop on Graph-Grammars and their Application to Computer Science; LNCS 532, Berlin, Springer-Verlag (1991)
5. Engels G, Lewerentz C, Nagl M, Schäfer W, Schiirr A.: Experiences in Building Integrated Tools, Part I: Tool Specification; in ACM Transactions on Software Engineering and Methodology, Vol. 1, No. 2, 135-167, ACM Press (1992)
6. Göttler H.: Graph-Grammatiken in der Softwaretechnik; IFB 178, Springer-Verlag (1988)
7. Gould R.: GRAPH THEORY; The Benjamin Cummings Publishing Company, Menlo Park, California (1988)
8. Haralick R. M, Elliot G. L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems; in Artificizil Intelligence, Vol. 14, 263-313 (1980)
9. Van Hentenryck P.: Constraint Satisfaction in Logic Programming; MIT Press, London (1989)
10. Lee H. -Y, Reid Th. F, Jarzabek St. (Eds): CASE '93 Proc. 6th Int. Workshop on Computer-Aided Software Engineering; IEEE Computer Society Press (1993)
11. Kiesel N, Schürr A, Westfechtel B.: Design and Evaluation of GRAS, a Graph-Oriented Database System for Engineering Applications; in [LeReJa 93], 272-286 (1992)
12. Schmidt G, Berghammer R. (Eds.): Graph-Theoretic Concepts in Computer Science; WG '91, LNCS 570, Berlin, Spfinger-Verlag (1992)
13. Schürr A.: Operationales Spezifizieren mit programmierten Graphersetzungssystemen; PhD. Thesis, RWTH Aachen, Wiesbaden, Deutscher Universitäts-Verlag (1991)
14. Schtürr A.: PROGRESS: A VHL-Language Based on Graph Grammars; in [EhKrRo 91], 641-659 (1991)
15. Z Zündorf: Implementation of the imperative/rule based language PROGRES; technical report, AIB 92-38, RWTH Aachen (1992)
16. Ztindorf A.: A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES; technical report, AIB 93-5, RWTH Aachen (1993)
17. Ziindorf A, Sehürr A.: Nondeterministic Control Structures for Graph Rewriting Systems; in [SehmiBer 92], 48-62 (1992)
18. Zündorf A.: PROgrammierte GRaphErsetzungsSysteme--Spezifikation, Implementierung und Anwendung einer integrierten Entwicklungsumgebung; PhD Thesis, RWTH Aachen (1994)