Efficient graph rewriting and its implementation
From MaRDI portal
Recommendations
Cited in
(18)- Finding a forest in a tree
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Lessons Learned from Building a Graph Transformation System
- scientific article; zbMATH DE number 4160147 (Why is no real title available?)
- GrGen: A Fast SPO-Based Graph Rewriting Tool
- Efficient Output-Sensitive Construction of Reeb Graphs
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- scientific article; zbMATH DE number 4080885 (Why is no real title available?)
- scientific article; zbMATH DE number 177433 (Why is no real title available?)
- Programmed graph transformations and graph transformation units in GRACE
- On edge addition rewrite systems and their relevance to program analysis
- Attributed graph rewriting system
- Needed computations shortcutting needed steps
- Extending graph rewriting with copying
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- Linear-time graph algorithms in GP 2
- Linear-time graph programs without preconditions
- Rule-based graph programs matching the time complexity of imperative algorithms
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)