String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
Discrete Applied Mathematics
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Reduction algorithms for graphs of small treewidth
Information and Computation
Efficient Graph Rewriting and Its Implementation
Efficient Graph Rewriting and Its Implementation
Linear matching-time algorithm for the directed graph isomorphism problem
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Relabelling in Graph Transformation
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Extending C for Checking Shape Safety
Electronic Notes in Theoretical Computer Science (ENTCS)
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
Transforming provenance using redaction
Proceedings of the 16th ACM symposium on Access control models and technologies
Efficient property preservation checking of model refinements
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the left-hand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establish a constant upper bound for the time needed to construct all graphs resulting from an application of a fixed rule to an input graph. We also give an improved upper bound under the stronger condition that all edges outgoing from a node must have distinct labels. Then this result is applied to identify a class of graph reduction systems that define graph languages with a linear membership test. In a case study we prove that the (non-context-free) language of balanced binary trees with backpointers belongs to this class.