Efficient graph rewriting and its implementation

MaRDI QIDQ1894781zbMATH OpenFDO

Authors Heiko Dörr

Publication date 24 July 1995

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of programming languages (68N15) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 234035
• Publication:5748897
• scientific article; zbMATH DE number 1088027
• Attributed graph rewriting system
• Implementing conditional term rewriting by graph rewriting

Cited in

(16)

• Programmed graph transformations and graph transformation units in GRACE
• scientific article; zbMATH DE number 4080885 (Why is no real title available?)
• Efficient Output-Sensitive Construction of Reeb Graphs
• The Edge of Graph Transformation — Graphs for Behavioural Specification
• scientific article; zbMATH DE number 7649899 (Why is no real title available?)
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Finding a forest in a tree
• On edge addition rewrite systems and their relevance to program analysis
• scientific article; zbMATH DE number 4160147 (Why is no real title available?)
• Attributed graph rewriting system
• Needed computations shortcutting needed steps
• GrGen: A Fast SPO-Based Graph Rewriting Tool
• scientific article; zbMATH DE number 177433 (Why is no real title available?)
• scientific article; zbMATH DE number 4049096 (Why is no real title available?)
• Lessons Learned from Building a Graph Transformation System
• Extending graph rewriting with copying

Describes a project that uses

Uses Software

• PROGRES
• Miranda

This page was built for publication: Efficient graph rewriting and its implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894781)